This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Load-Balanced Short-Path Routing in Wireless Networks
April 2006 (vol. 17 no. 4)
pp. 377-388

Abstract—We study routing algorithms on wireless networks that use only short paths, for minimizing latency, and achieve good load balance, for balancing the energy use. We consider the special case when all the nodes are located in a narrow strip with width at most {\sqrt3}/2\approx 0.86 times the communication radius. We present algorithms that achieve good performance in terms of both measures simultaneously. In particular, the routing path is at most four times the shortest path length and the maximum load on any node is at most three times that of the most load-balanced algorithm without path-length constraint. In addition, our routing algorithms make routing decisions by only local information and, as as a consequence, are more adaptive to topology changes due to dynamic node insertions/deletions or due to mobility.

[1] S. Albers, “Better Bounds for Online Scheduling,” Proc. ACM Symp. Theory of Computing, pp. 130-139, 1997.
[2] Y. Azar, “On-Line Load Balancing,” On-Line Algorithms: The State of the Art, A. Fiat and G. Woeginger, eds., pp. 178-195. Springer, 1998.
[3] A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge Univ. Press, 1998.
[4] J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. Infocom, pp. 22-31, 2000.
[5] J.-H. Chang and L. Tassiulas, “Fast Approximation Algorithms for Maximum Lifetime Routing in Wireless Ad-Hoc Networks,” Networking, pp. 702-713, 2000.
[6] J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Discrete Mobile Centers,” Discrete and Computational Geometry, vol. 30, no. 1, pp. 45-65, 2003.
[7] J. Gao, L.J. Guibas, and A. Nguyen, “Distributed Proximity Maintenance in Ad Hoc Mobile Networks,” Proc. IEEE Int’l Conf. Distributed Computing in Sensor Systems (DCOSS), June 2005.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman, 1979.
[9] N. Gupta and S.R. Das, “Energy-Aware On-Demand Routing for Mobile Ad Hoc Networks,” Proc. Int'l Workshop Distributed Computing (IWDC), pp. 164-173, 2002.
[10] H. Hartenstein, B. Bochow, A. Ebner, M. Lott, M. Radimirsch, and D. Vollmer, “Position-Aware Ad Hoc Wireless Networks for Inter-Vehicle Communications: The Fleetnet Project,” Proc. Second ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '01), pp. 259-262, 2001.
[11] J. Hightower and G. Borriello, “Location Systems for Ubiquitous Computing,” Computer, vol. 34, no. 8, pp. 57-66, Aug. 2001.
[12] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H. Korth, eds., vol. 353, pp. 153-181. Kluwer Academic, 1996.
[13] Q. Li, J. Aslam, and D. Rus,“Online Power-Aware Routing in Wireless Ad-Hoc Networks,” Proc. Ann. Int’l Conf. Mobile Computing and Networking (MobiCom), pp. 97-107, 2001.
[14] T. Melodia, D. Pompili, and I.F. Akyildiz, “Optimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks,” Proc. IEEE Conf. Computer Comm. (Infocom '04), pp. 1706-1717, 2004.
[15] C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, 1999.
[16] S.A. Plotkin, “Competitive Routing of Virtual Circuits in ATM Networks,” IEEE J. Selected Areas in Comm., vol. 13, no. 6, pp. 1128-1136, 1995.
[17] P. Raghavan, “Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs,” J. Computer and System Sciences, pp. 130-143, 1988.
[18] P. Raghavan and C.D. Thompson, “Provably Good Routing in Graphs: Regular Arrays,” Proc. 17th Ann. ACM Symp. Theory of Computing, pp. 79-87, 1985.
[19] S. Ramanathan and M. Steenstrup, “A Survey of Routing Techniques for Mobile Communications Networks” Mobile Networks and Applications, vol. 1, no. 2, pp. 89-104, 1996.
[20] A. Savvides, C.-C. Han, and M.B. Strivastava, “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors,” Proc. Ann. Int’l Conf. Mobile Computing and Networking (MobiCom), pp. 166-179, 2001.
[21] S. Singh, M. Woo, and C.S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. Ann. Int’l Conf. Mobile Computing and Networking (MobiCom), pp. 181-190, 1998.
[22] V. Srinivasan, C.F. Chiasserini, P. Nuggehalli, and R.R. Rao, “Optimal Rate Allocation and Traffic Splits for Energy Efficient Routing in Ad Hoc Networks,” Proc. 21st Ann. Joint Conf. IEEE Computer and Comm. Soc. (Infocom), vol. 2, pp. 950-957, 2002.
[23] I. Stojmenovic and X. Lin, “Power Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, Nov. 2001.
[24] A. Ward, A. Jones, and A. Hopper, “A New Location Technique for the Active Office,” IEEE Personal Comm., vol. 4, no. 5, pp. 42-47, Oct. 1997.
[25] Y. Xu, J.S. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. Ann. Int’l Conf. Mobile Computing and Networking (MobiCom), pp. 70-84, 2001.
[26] W. Yu and J. Lee, “DSR-Based Energy-Aware Routing Protocols in Ad Hoc Networks,” Proc. Int’l Conf. Wireless Networks, 2002.
[27] Y. Yu, R. Govindan, and D. Estrin, “Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks,” Technical Report tr-01-0023, Dept. of Computer Science, Univ. of California, Los Angeles, 2001.
[28] G. Zussman and A. Segall,“Energy Efficient Routing in Ad Hoc Disaster Recovery Networks,” Proc. IEEE Conf. Computer Comm. (Infocom '03), pp. 682 -691, 2003.

Index Terms:
Wireless network, load-balanced routing, short-path routing.
Citation:
Jie Gao, Li Zhang, "Load-Balanced Short-Path Routing in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 377-388, April 2006, doi:10.1109/TPDS.2006.49
Usage of this product signifies your acceptance of the Terms of Use.