BLR: beacon-less routing algorithm for mobile ad hoc networks

Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well with these scenarios. The beacon-less routing algorithm (BLR) presented in this paper is a routing protocol that makes use of location information to reduce routing overhead. However, unlike other position-based routing protocols, BLR does not require nodes to periodically broadcast Hello-messages (called beaconing), and thus avoids drawbacks such as extensive use of scarce battery-power, interferences with regular data transmission, and performance degradation. BLR selects a forwarding node in a distributed manner among all its neighboring nodes with having information neither about their positions nor even about their existence. Data packets are broadcasted and the protocol takes care that just one of the receiving nodes forwards the packet. Optimized forwarding is achieved by applying a concept of dynamic forwarding delay. Consequently, the node that computes the shortest forwarding delay relays the packet first. This forwarding is detected by the other nodes and suppresses them to relay the same packet any further. Analytical results and simulation experiments indicate that BLR provides efficient and robust routing in highly dynamic mobile ad hoc networks.

[1]  Ivan Stojmenovic,et al.  Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy , 2004 .

[2]  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).

[3]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[4]  Randy H. Katz,et al.  Measuring and Reducing Energy Consumption of Network Interfaces in Hand-Held Devices (Special Issue on Mobile Computing) , 1997 .

[5]  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.

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

[7]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2000, ISAAC.

[8]  Torsten Braun,et al.  Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks , 2003, KiVS Kurzbeiträge.

[9]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[10]  Marc Heissenbuttel.  A Novel Position-based and Beacon-less Routing Algorithm for Mobile Ad-Hoc Networks , 2003 .

[11]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[12]  Jean-Yves Le Boudec,et al.  Self Organized Terminode Routing , 2002, Cluster Computing.

[13]  Jörg Widmer,et al.  Beaconless Position-Based Routing for Mobile Ad-Hoc Networks , 2003 .

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

[15]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

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

[17]  Richard G. Ogier,et al.  A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[18]  Tomasz Imielinski,et al.  GeoCast—geographic addressing and routing , 1997, MobiCom '97.

[19]  Ivan Stojmenovic,et al.  A routing strategy and quorum based location update scheme for ad hoc wireless networks , 1999 .

[20]  Zygmunt J. Haas,et al.  ZRP: a hybrid framework for routing in Ad Hoc networks , 2001 .

[21]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[22]  Nitin H. Vaidya,et al.  Location-Based Multicast in Mobile Ad Hoc Networks , 1998 .

[23]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[24]  Leonard Kleinrock,et al.  The Spatial Capacity of a Slotted ALOHA Multihop Packet Radio Network with Capture , 1984, IEEE Trans. Commun..

[25]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[26]  Mario Gerla,et al.  Fisheye State Routing in Mobile Ad Hoc Networks , 2000, ICDCS Workshop on Wireless Networks and Mobile Computing.

[27]  Nitin H. Vaidya,et al.  Geocasting in mobile ad hoc networks: location-based multicast algorithms , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[28]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[29]  Sang Hyuk Son,et al.  IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks , 2003 .

[30]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[31]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.

[32]  Ernst W. Biersack,et al.  Scalable feedback for large groups , 1999, TNET.

[33]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[34]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

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

[36]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[37]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[38]  Martin Vetterli,et al.  Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks , 2003, INFOCOM.

[39]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[40]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[41]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[42]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[43]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[44]  J.-Y. Le Boudec,et al.  Toward self-organized mobile ad hoc networks: the terminodes project , 2001, IEEE Commun. Mag..

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