1 / 21

Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED

Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED. Kaixin Xu, Mario Gerla UCLA Computer Science Department {xkx,gerla}@cs.ucla.edu Lantao Qi,Yantai Shu Department of Computer Science Department, Tianjin University {ltqi,ytshu}@tju.edu.cn.

lorand
Télécharger la présentation

Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department {xkx,gerla}@cs.ucla.edu Lantao Qi,Yantai Shu Department of Computer Science Department, Tianjin University {ltqi,ytshu}@tju.edu.cn

  2. Three different types of challenges are posed to TCP in MANET • 1. Mobility causes changing of topology and route change, cause TCP goes to exponentially back-off • 2. The second problem deal with congestion window in use. • 3. The third problem is significant TCP unfairness. • This paper focuses on the third problem.

  3. RED can improve congestion control and fairness in wired network • Suppose the current queue size is q • The avg queue size is computed as Pb maxth 1 0 q minth

  4. FTP 1 FTP 2 FTP 3 TCP UNFAIRNESS AND RED IN MANET • FTP 2 is always starved. RED does not improve fairness. This is because congestion does not happens in a single node, but in an entire area.

  5. Neighborhood and its Distributed Queue • Neighborhood: A node’s neighborhood consists of the node itself and the nodes which can interfere with this node’s signal, which includes 1-hop neighbors and 2-hop neighbors. • (normally interference range is much larger than data transmission range, which is simplified in this paper).

  6. Neighborhood and its Distributed Queue • The main idea of this paper is to treat this distributed queue of a neighborhood in an manet the same way as we would on a single link queue in the wired net and apply RED to it. • 1. A neighborhood queue consists of multiple queues located at the neighboring nodes that are part of the same spatial reuse constraint set. • 2. Multiple sub-queues have different relative priorities in terms of acquiring the wireless channel due to various factors including MAC unfairness, channel capture, hidden and exposed terminal etc. • 3. The priority of a sub-queue may change dynamically due to topology or traffic pattern changes.

  7. NEIGHBORHOOD RANDOM EARLY DETECTION • Make packet drop probability and packet delay proportional to the share of bandwidth used by each TCP flow. • 1. Neighborhood Congestion Detection (NCD) • 2. Neighborhood congestion Notification (NCN) • 3. Distributed Neighborhood Packet Drop (DNPD)

  8. Neighborhood Congestion Detection (NCN) • When a packet in any outgoing queue is transmitted, node A will detect the medium as busy. • When a packet is received to any incoming queue, node A can also learn this through the CTS packet.

  9. Neighborhood Congestion Detection (NCN) • A node will monitor 5 fifferent radio state • 1. Transmitting • 2. Receiving • 3. Carrier sensing busy (RTS, CTS) • 4. Virtual carrier sensing busy • 5. Idle • State 1&2 is for current node, 3&4 is for its neighbors. The authors assume state 5 means empty queue.

  10. Neighborhood Congestion Detection (NCN)

  11. Neighborhood Congestion Notification Under NRED, a node checks the estimated avg queue size avg periodically and compares it with old min threshold. The node calculates a drop prob pb and broadcasts it to its neighbors if the following Constraints Holds for the current nodes. The calculated Pb is larger than 0. On the path of one or more flows Suffering in channel contention (by comparing avgtx+avgrx with a threshold. Didn’t receive any NCN in the past interval with a larger normalizedPb. Otherwise the neighborhood is more congested. <packetType, normalizedPb,lifeTime>

  12. Distributed Neighborhood Packet Drop • When a node received a NCN with a none zero normalizedPb, the local drop prob pb is caculated as normalizedPb*(avg_tx+avg_rx).

  13. VERIFICATION ANDPARAMETER TUNING • Verification of Queue • Size Estimation

  14. VERIFICATION AND PARAMETER TUNING • Parameter Tuning with Basic Scenarios with hidden and exposed terminal scenario.

  15. VERIFICATION AND PARAMETER TUNING • Fairness index • MAXMin fairness is bounded between 0 and 1 Hidden terminal situation with various max_p values Exposed terminal situation with various max_p values

  16. VERIFICATION AND PARAMETER TUNING • Aggregated Throughput (kbps) under hidden and exposed terminal situation

  17. PERFORMANCE EVALUATION OF NRED • Overall throughput of the 3 flows.

  18. PERFORMANCE EVALUATION OF NRED • Multiple Congested Neighborhood

  19. PERFORMANCE EVALUATION OF NRED • More Realistic Scenario. 50 nodes randomly deployed in 1000X1000m. 5FTP/TCP are randomly selected.

  20. PERFORMANCE EVALUATION OF NRED • Performance under Mobility

  21. CONCLUSION By detecting early congestion and dropping packets proportionally to a flow’s channel bandwidth usage, the NRED is able to improve TCP fairness. The major contributions of this work are the concept of a distributed neighborhood queue and the design does not require MAC modification.

More Related