280 likes | 404 Vues
This paper discusses a novel approach to alleviate congestion in wireless networks through multipath routing mechanisms. The focus is on two key algorithms: In-network Packet Scatter (IPS) and End-to-end Packet Scatter (EPS), which effectively split traffic flows and reduce congestion in contention areas. The proposed algorithms adapt to network conditions and improve overall throughput and fairness. Through simulations and practical tests, results show significant improvements in packet delivery and network performance. Practical applications and future work in this area are also explored.
E N D
ICNP 2006 Reducing Congestion Effects in Wireless Networks by Multipath Routing Presented by Dian Zhang Lucian Popa, Costin Raiciu, University of California, Berkeley
Outline • Problem statement and assumptions • BGR • congestion control mechanism • IPS • EPS • Performance evaluation • Conclusions
Overview a point-to-point communication in a large Wireless Network
Overview Goal: Split flows and reduce congestion by having less traffic in a contention/interference area. • Improve overall throughput • Improve fairness
Multipath Routing-related work • We need alternate paths to avoid congested hotspots • Existing solutions not satisfactory • Way points • Simple • Course Grained • Trajectory Based Forwarding [Niculescu03] • Fine Grained • Complex and resource consuming
Biased Geographical Routing (BGR) • Idea • Insert a “bias” inside the packet as a measure of the deviation from the greedy path • Achieve different paths by using different biases large bias small bias bias = 0
BGR Details • Bias = Angle • Route greedy towards a close by point projected at “bias” angle • Decrease bias at each step • Quadratic dependence on distance to destination • Stop decreasing when it reaches zero bias1 Destination
BGR Details • Bias = Angle • Route greedy towards a close by point projected at “bias” angle • Decrease bias at each step • Quadratic dependence on distance to destination • Stop decreasing when it reaches zero bias2 Destination
BGR Details • Bias = Angle • Route greedy towards a close by point projected at “bias” angle • Decrease bias at each step • Quadratic dependence on distance to destination • Stop decreasing when it reaches zero bias3 Destination
Overview We propose two algorithms to deal with congestion 1. IPS - In-network Packet Scatter • Local algorithm • Lightweight – no per flow state • Suited for short flows or light congestion 2. EPS – End-to-end Packet Scatter • End to end – rate control, relies on receiver feedback • Suited for long flows and widespread congestion
IPS (In-network packet scatter) Learn about congested neighbors
IPS (In-network packet scatter) Deviate uniformly traffic to congested nodes on three paths
EPS (End-to-end packet scatter) Destination Source
EPS (End-to-end packet scatter) Destination Congested node Source
EPS (End-to-end packet scatter) Destination feedback Source
EPS (End-to-end packet scatter) Destination Source
EPS (End-to-end packet scatter) Central path is prioritized Destination Exterior paths are less aggressive than the central one Source
EPS (End-to-end packet scatter) Most traffic on least congested path Destination Source
IPS+EPS • The two algorithms can be used • Independently • Combined
ns2 setup • 400 nodes grid • 802.11 wireless • Random source-destination pairs • Success measured as received number of packets
Throughput vs Hop Count Increase on AIMD(%)
Testbed • Mirage sensor network testbed • ~100 nodes • But too “narrow” – interference on one side • Thus, our main goal was to estimate in practice potential for throughput increase
Testbed metodology • Throughput of vs
Testbed results • % Increase in received packets for two BGR paths of 40 degree bias compared to single paths
Conclusions • BGR • An efficient and practical multipath algorithm for wireless networks with location information • IPS, EPS • Two mechanisms to increase fairness and throughput by multipath routing • Practical tests
ICNP 2006 Thank you!