Load Balanced Link Reversal Routing in Wireless Ad Hoc Networks

The link reversal routing (LRR) algorithm maintains loop free routes in mobile ad hoc wireless networks while incurring low overhead. In this paper we explore the problem of balancing the load of forwarding traffic in LRR algorithm. We make some important observations regarding the situations that lead to load unbalance in the LRR algorithm and formally define the load balancing problem. Based on our observations we propose three modifications to the LRR algorithm such that the load may be distributed in a more uniform manner. The modifications preserve all the desirable qualities of LRR algorithms such as loop free routes, local response to topology change, low overhead and are completely distributed in nature. We perform simulations in order to evaluate the performance of the proposed modifications for both single-path and multipath scenarios. It is observed that the modifications enable LRR algorithm to provide a much improved load balance.

[1]  Evan P. C. Jones,et al.  Multipath load balancing in multi-hop wireless networks , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[2]  Jie Gao,et al.  Load-Balanced Short-Path Routing in Wireless Networks , 2006, IEEE Trans. Parallel Distributed Syst..

[3]  Ramez Elmasri,et al.  Balancing loads in mobile ad hoc networks , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[4]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[5]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile radio networks , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[6]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[7]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[8]  Fikret Sivrikaya,et al.  Contention-Free MAC Protocols for Wireless Sensor Networks , 2004, DISC.

[9]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[11]  Hossam S. Hassanein,et al.  Routing with load balancing in wireless Ad hoc networks , 2001, MSWIM '01.

[12]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[13]  D. Manjunath,et al.  Communication Networking: An Analytical Approach , 2004 .

[14]  H. T. Kung,et al.  Load-balancing routing for wireless access networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Abtin Keshavarzian,et al.  Load balancing in ad hoc networks: single-path routing vs. multi-path routing , 2004, IEEE INFOCOM 2004.

[16]  Zygmunt J. Haas,et al.  On the impact of alternate path routing for load balancing in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[17]  Srikanta Tirthapura,et al.  Analysis of link reversal routing algorithms for mobile ad hoc networks , 2003, SPAA '03.

[18]  Adam Wolisz,et al.  Load Balancing for Centralized Wireless Networks , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

[19]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.