Hidden Problems with the Hidden Node Problem

Transcription

1 Hidden Problems with the Hidden Node Problem

2 Hidden Node Problem A B C Hidden node Outside the TX range of sender but within the range of receiver. C is hidden node! Throughput is decreased. Larger data packets are more vulnerable.

3 Solution in IEEE For unicast packets it s a solved problem Four-way handshake RTS/CTS/DATA/ACK A B

4 Solution in IEEE For unicast packets it s a solved problem Four-way handshake RTS/CTS/DATA/ACK A B

5 Solution in IEEE For unicast packets it s a solved problem Four-way handshake RTS/CTS/DATA/ACK A B

6 Formally Duration field RTS DATA Sender CTS ACK Receiver Blue/red Node BSY Virtual CS Yellow Node BSY

7 Problem I: Prohibiting Parallel TX [1] Q A B P

8 Problem I: Prohibiting Parallel TX [1] Blue nodes can transmit in Parallel Yellow nodes can Receive in Parallel A B Red nodes are helpless!

9 Detecting Opportunities For Parallel TX If a node receives only RTS Can transmit in parallel If a node receives only CTS Can Receive in parallel If a node receives both RTS + CTS Can do nothing

10 Detecting Opportunities Does not help! Q A B P Duration field RTS DATA Sender CTS ACK Receiver Blue/red Node BSY Virtual CS Yellow Node BSY

11 Solution MAC-P [1] What is missing? 1. A time gap between RTS/CTS and Data so that potential nodes for parallel transmission can also exchange RTS-CTS 2. Consequently, an indication in RTS- CTS packets about the start time of Data and ACK packets

12 Solution MAC-P [1] Transmitting in Parallel RTS/CTS Source Dest T DATA T ACK Q R A B Master Transmission RTS T DATA T ACK DATA A CTS T DATA T ACK ACK B RTS T DATA DATA T ACK Q CTS T DATA T ACK ACK R

13 Solution MAC-P [1] Transmitting in Parallel RTS/CTS Source Dest T DATA T ACK Q A B P Z Master Transmission RTS T DATA T ACK DATA A CTS T DATA T ACK ACK B RTS DATA Z CTS ACK P

14 Principle for Parallel transmission A B Q P A B Q P There can be at most one transmitter within the reception range of a receiver A B Q P A B Q P A B Q P

15 MAC-P Performance Comparison

16 MAC-P Performance Comparison

17 MAC-P limitations: Packet size for non-master transmission should be less than that of master transmission. Designed for static network. For Mobile Network enabling parallel transmission is still an open problem!

18 Problem II: RTS/CTS-induced congestion [2]

19 Problem II: RTS/CTS-induced congestion [2] -MAC layer takes certain number of attempts and then drops. - It looks like congestion although buffer may still have space.

20 Blocked Node A C B Blocked D RTS

21 False blocking A C B Blocked RTS D E Falsely blocked

22 False blocking may propagate! A E C B Blocked RTS D G F

23 Pseudo deadlock

24 Pseudo deadlock

25 Solution RTS Validation

26 Problem III: Virtual Jamming [3] REAL JAMMING (Continuously generate interfering signals) DoS Attack VIRTUAL JAMMING (Pretend that you are transmitting)

27 Way of V. Jamming Duration field Format of RTS/CTS packet Large value on Duration field. Solution! Duration field is a 16 bit integer number. Deny access -Put for as a high large cap. as 32,767 micro second. -Ignore anything Roughly 30 RTS (30 X 32,767 = 983,010 microsec) packets per second above a is threshold. enough for full Denial of service!

28 Second kind of attack Attacker Receiver Blue/Red Node BSY BSY Yellow Node BSY BSY

29 Special scenario

30 Simulation Model Modified existing implementation of IEEE in NS2. TR range equals CS range. Packet size 1024 bytes. Destination is within one-hop i.e. no routing protocol. No error model.

31 Effect on throughput Without Attack With Attack

32 Solution: RTS Validation Validate RTS by sensing the channel (Backward compatible!) When to validate?? Attacker Carrier Sense Receiver Blue/Red Node X X BSY Yellow Node BSY

33 Partial Virtual Jamming Validate RTS by sensing the channel (Backward compatible!) When to validate?? Attacker Carrier Sense Receiver Blue/Red Node BSY Yellow Node BSY

34 Solution: Random RTS Validation Validate RTS by sensing the channel (Backward compatible!) When to validate?? Attacker Carrier Sense Receiver Node 1 BSY Node 2 BSY

35 Throughput after Random RTS validation With Attack With Random RTS Validation

36 More Experimental result Throughput

37 More Experimental result Delay

38 Future Direction Experiment with random scenarios. Lone CTS is a great problem! How about in mobile environment? Can we tell with reasonable confidence that the hidden node problem is a solved problem??

39 Refernces [1] MACA-P: A MAC for Concurrent transmissions in Multi-hop Wireless Networks, Arup Acharya, archan Misra and Sorav Bansal. [2] RTS/CTS-Induced Congestion in Ad Hoc Wireless LANS, Saikat Ray, Jeffrey B. Carruthers and David Starobinski. [3] Protecting Wireless Networks against a Denial of Service Attack Based on Virtual Jamming, Dazhi Chen, Jing Deng, and Pramod K. Varshney. [4] Denial-of-Service Attacks: Real Vulnerabilities and Practical Solutions, John Bellardo and Stefen Savage.

40 End!