LABAR: location area based ad hoc routing for GPS-scarce wide-area ad hoc networks

Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem in conjunction with ad hoc networks is routing, i.e., the procedure in charge of determining the trajectory of packets traveling over the network. For large-scale ad hoc networks scalability of the routing approach is extremely important. One of the approaches to scale up ad hoc routing is geographical location based routing, which usually requires all nodes to be aware of their exact locations. In this paper, a new routing algorithm is proposed which requires only a subset of nodes to know their exact location forming location areas around these nodes. This paper outlines the LABAR (Location Area Based Ad Hoc Routing) routing protocol and provides simulation measurements on its average routing distance compared to the optimum shortest path.

[1]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[2]  David A. Maltz,et al.  The dynamic source routing for mobile ad hoc networks , 2001 .

[3]  Imrich Chlamtac,et al.  Bluetrees-scatternet formation to enable Bluetooth-based ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[4]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[5]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

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

[8]  Elliott D. Kaplan.  Understanding GPS : principles and applications , 1996 .

[9]  Tracy Camp,et al.  Performance comparison of two location based routing protocols for ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[11]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

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

[13]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[14]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[15]  Ivan Stojmenovic,et al.  Depth first search and location based localized routing and QoS routing in wireless networks , 2000, Proceedings 2000 International Conference on Parallel Processing.

[16]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[17]  Ding-Zhu Du,et al.  Virtual Backbone-Based Routing in Multihop Ad Hoc Wireless Networks , 2002 .

[18]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[19]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[20]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..