Performance of the beacon-less routing protocol in realistic scenarios

The beacon-less routing protocol (BLR) is a position-based routing protocol for mobile ad-hoc networks that makes use of location information to reduce routing overhead. Unlike other position-based routing protocols, BLR does not require nodes to periodically broadcast hello messages. This avoids drawbacks such as extensive use of scarce battery-power, interferences with regular data transmission, and outdated position information in case of high mobility. This paper discusses the behavior and performance of BLR in realistic scenarios, in particular with irregular transmission ranges. BLR has been implemented using appropriate simulation models and in an out-door test-bed consisting of GNU/Linux laptops with wireless LAN network interfaces and GPS receivers.

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

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

[3]  Richard Gold,et al.  LUNAR - A Lightweight Underlay Network Ad-hoc Routing Protocol and Implementation , 2004 .

[4]  L. R. Maciel,et al.  Radio propagation characteristics for line-of-sight microcellular and personal communications , 1993 .

[5]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[6]  Hao Wang,et al.  A wireless LAN-based indoor positioning technology , 2004, IBM J. Res. Dev..

[7]  Torsten Braun,et al.  Optimized Stateless Broadcasting in Wireless Multi-Hop Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  J. Rabaey,et al.  Joint optimization of a protocol stack for sensor networks , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

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

[10]  H.T. Friis,et al.  A Note on a Simple Transmission Formula , 1946, Proceedings of the IRE.

[11]  Torsten Braun,et al.  BLR: beacon-less routing algorithm for mobile ad hoc networks , 2004, Comput. Commun..

[12]  Gang Zhou,et al.  Impact of radio irregularity on wireless sensor networks , 2004, MobiSys '04.

[13]  Marc Heissenbüttel,et al.  Routing and Broadcasting in Ad-Hoc Networks , 2007, KiVS.

[14]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[15]  M. Kurth,et al.  An Opportunistic Cross-Layer Protocol for Multi-Channel Wireless Networks , 2007, 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications.

[16]  Cédric Westphal,et al.  Opportunistic Routing in Dynamic Ad Hoc Networks: the OPRAH protocol , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[17]  M. Vetterli,et al.  Locating mobile nodes with EASE: learning efficient routes from encounter histories alone , 2006, IEEE/ACM Transactions on Networking.

[18]  Torsten Braun,et al.  Evaluating the limitations of and alternatives in beaconing , 2007, Ad Hoc Networks.

[19]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.