An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks

-In this paper, an algorithm for efficient network-wide broadcast (NWB) in mobile ad hoc networkds (MANETs) is proposed. The algorithm is performed in an asynchronous and distributed manner by each network node. The algorithm requires only limited topology knowledge, and therefore, is suitable for reactive MANET routing protocols. Simulations show that the proposed algorithm is on average 3-4 times as efficient as brute force flooding. Further, simulations show that the proposed algorithm compares favorably over a wide range of network sizes, with a greedy algorithm using global topology knowledge, in terms of minimizing packet transmissions. The application of the algorithm to route discovery in on-demand routing protocols is discussed in detail. Proofs of the algorithm's reliability and of the intracatability of solving for a minimum sized transmitter set to perform NWB are also given.

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

[2]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[3]  Imrich Chlamtac,et al.  The wave expansion approach to broadcasting in multihop radio networks , 1991, IEEE Trans. Commun..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Lusheng Ji,et al.  A lightweight adaptive multicast algorithm , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[6]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[7]  M. Jiang,et al.  Cluster based routing protocol (CBRP) , 1999 .

[8]  Pierre A. Humblet A Distributed Algorithm for Minimum Weight Directed Spanning Trees , 1983, IEEE Trans. Commun..

[9]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[10]  Abhay Parekh,et al.  Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs , 1991, Inf. Process. Lett..

[11]  Elena Pagani,et al.  Providing reliable and fault tolerant broadcast delivery in mobile ad‐hoc networks , 1999, Mob. Networks Appl..

[12]  Baruch Awerbuch,et al.  A reliable broadcast protocol , 1982, CDC 1982.

[13]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..

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

[15]  Imrich Chlamtac,et al.  Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.

[16]  Imrich Chlamtac,et al.  Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.

[17]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.

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

[19]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.