ACM Home Page
Please provide us with feedback. Feedback
Balancing traffic load in wireless networks with curveball routing
Full text PdfPdf (665 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing table of contents
Montreal, Quebec, Canada
SESSION: Routing algorithms table of contents
Pages: 170 - 179  
Year of Publication: 2007
ISBN:978-1-59593-684-4
Authors
Lucian Popa  UC Berkeley, Berkeley, CA
Afshin Rostamizadeh  NYU, New York, NY
Richard Karp  UC Berkeley, Berkeley, CA
Christos Papadimitriou  UC Berkeley, Berkeley, CA
Ion Stoica  UC Berkeley, Berkeley, CA
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 191,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1288107.1288131
What is a DOI?

ABSTRACT

We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink pairs. When routing along shortest paths, the nodes that are centrally located forward a disproportionate amount of traffic. This translates into increased congestion and energy consumption. However, the maximum load can be decreased if the packets follow curved paths. We show that the optimum such routing scheme can be expressed in terms of geometric optics and computed by linear programming. We then propose a practical solution, which we call Curveball Routing which achieves results not much worse than the optimum.

We evaluate our solution at three levels of fidelity: a Java high-level simulator, the ns2 simulator, and the Intel Mirage Sensor Network Testbed. Simulation results using the high-level simulator show that our solution successfully avoids the crowded center of the network, and reduces the maximum load by up to 40%. At the same time, the increase of the expected path length is minimal, i.e., only 8% on average. Simulation results using the ns2 simulator show that our solution can increase throughput on moderately loaded networks by up to 15%, while testbed results show a reduction in peak energy usage by up to 25%. Our prototype suggests that our solution is easily deployable.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Kalantari, M. Shayman, "Design Optimization of Multi-Sink Sensor Networks by Analogy to Electrostatic Theory" IEEE WCNC, 2006
 
2
P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Transactions on Information Theory, 2000.
3
4
5
6
7
 
8
Demibras, M., Arora, A., AND Gouda, M. A pursuer evader game for sensor networks. In Proc. of the Sixth Symposium on Self-Stabilizing Systems, 2003
 
9
S. Baek and G. de Veciana, Spatial Energy Balancing Large-scale Wireless Multihop Networks, IEEE INFOCOM05
10
 
11
ns2 simulator, http://www.isi.edu/nsnam/ns/
 
12
TinyOs, http://www.tinyos.net.
 
13
 
14
G. Yashar and A. Keshavarzian, Load balancing in ad hoc networks: Single-path routing vs. multi-path routing, IEEE Infocom 2004.
 
15
P. Gupta, P. R. Kumar, "Towards an Information Theory of Large Networks: An Achievable Rate Region", IEEE Transactions on Information Theory, 2003
16
17
18
 
19
Intel Mirage testbed, http://mirage.berkeley.intel-research.net
20
 
21
 
22
Proof for Theorem 1 listed at: www.cs.berkeley.edu/~popa/proof_wireless_disc_load.pdf
 
23
Greenstein B., Estrin, D., Govindan, R., Ratnasamy, S., Shenker, S. DIFS: A distributed index for features in sensor networks. In IEEE WSNA 2003.
 
24
 
25
P.P. Pham and Sylvie Perreau, "Performance analysis of reactive shortest path and multi-path routing mechanism with load balance", IEEE Infocom 2003
 
26
 
27
E. Hyytiä, J. Virtamo, "On Load Balancing in a Dense Wireless Multihop Network", NGI 2006, Valencia, Spain
28
 
29
R. Catanuto, S. Toumpis, G. Morabito, "Opti{c,m}al: Optical/Optimal Routing in Massively Dense Wireless Networks", IEEE Infocom 2007


Collaborative Colleagues:
Lucian Popa: colleagues
Afshin Rostamizadeh: colleagues
Richard Karp: colleagues
Christos Papadimitriou: colleagues
Ion Stoica: colleagues