Efficient implementations of all-to-all broadcasting in mobile ad hoc networks

In order to ease the challenging task of information dissemination in a MANET, we employ a legend: a data structure passed around a network to share information with all the mobile nodes. Our motivating application of the legend is sharing location information. Previous research shows that a simplistic legend performs better than other location services in the literature. To realize the full potential of legend-based location services, we propose three methods for the legend to traverse a network and compare their performance in simulation. Two of our proposed methods are novel, and the third is an improvement on an existing method. We also evaluate several general improvements to the traversal methods, and describe our way of making the legend transmission reliable. The result is a simple, lightweight location service that makes efficient use of network resources. Beyond using the legend as a location service, we discuss several implementation aspects of providing an efficient all-to-all broadcast operation, including legend reliability, preventing duplicate legends, using a legend in dynamic networks, and working with non-synchronized clocks. We also provide pseudocode for our legend traversal methods to aid implementation.

[1]  Tracy Camp,et al.  An information dissemination protocol for an ad hoc network , 2004, IEEE International Conference on Performance, Computing, and Communications, 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]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[4]  Tracy Camp,et al.  An agile approach to distributed information dissemination in mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[5]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

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

[7]  Antonio Alfredo Ferreira Loureiro,et al.  A novel routing algorithm for ad hoc networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

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

[9]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[10]  Tracy Camp,et al.  Stationary distributions for the random waypoint mobility model , 2004, IEEE Transactions on Mobile Computing.

[11]  Cauligi S. Raghavendra,et al.  Energy efficient broadcasting for situation awareness in ad hoc networks , 2001, International Conference on Parallel Processing, 2001..

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

[13]  Tracy Camp,et al.  Location information services in mobile ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[15]  Mingyan Liu,et al.  Sound mobility models , 2003, MobiCom '03.

[16]  Martin Mauve,et al.  A Simulation Study of a Location Service for Position-Based Routing in Mobile Ad Hoc Networks , 2002 .

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[19]  Chen-Khong Tham,et al.  Mobile agents based routing protocol for mobile ad hoc networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.