Minimizing broadcast latency and redundancy in ad hoc networks

Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. In this paper, we consider the problem of collision-free broadcasting in ad hoc networks. Our objective is to minimize the latency and the number of transmissions in the broadcast. We show that minimum latency broadcasting is NP-complete for ad hoc networks. We also present a simple distributed collision-free broadcasting algorithm for broadcasting a message. For networks with bounded node transmission ranges, our algorithm simultaneously guarantees that the latency and the number of transmissions are within O(1) times their respective optimal values. Our algorithm and analysis extend to the case when multiple messages are broadcast from multiple sources. Experimental studies indicate that our algorithms perform much better in practice than the analytical guarantees provided for the worst case.

[1]  Douglas S. Reeves,et al.  The delay-constrained minimum spanning tree problem , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[2]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[3]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[4]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[5]  Andrea Vitaletti,et al.  Localized techniques for broadcasting in wireless sensor networks , 2004, DIALM-POMC '04.

[6]  Vaduvur Bharghavan,et al.  Spine routing in ad hoc networks , 1998, Cluster Computing.

[7]  Chih-Shun Hsu,et al.  Scheduling of broadcasts in multihop wireless networks , 2003 .

[8]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

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

[10]  Gene Tsudik,et al.  Flooding for reliable multicast in multi-hop ad hoc networks , 1999, DIALM '99.

[11]  Wojciech Rytter,et al.  Deterministic broadcasting in unknown radio networks , 2000, SODA '00.

[12]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[13]  Gene Tsudik,et al.  Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks , 1999, DIALM '99.

[14]  Guy Kortsarz,et al.  Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem , 2002, STOC '02.

[15]  Imrich Chlamtac,et al.  A mobility-transparent deterministic broadcast mechanism for ad hoc networks , 1999, TNET.

[16]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[17]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.

[18]  Andrzej Pelc,et al.  Deterministic broadcasting time in radio networks of unknown topology , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[19]  Danilo Bruschi,et al.  Lower bounds for the broadcast problem in mobile radio networks , 1997, Distributed Computing.

[20]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

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

[22]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[23]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[24]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[25]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[26]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

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

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

[29]  Wei Peng,et al.  AHBP: An efficient broadcast protocol for mobile Ad hoc networks , 2001, Journal of Computer Science and Technology.

[30]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[31]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[32]  Dave Maltz,et al.  A Simple Protocol for Multicast and Broadcast in Mobile Ad Hoc Networks , 2001 .

[33]  Peng Wei,et al.  Efficient Broadcast in Mobile Ad Hoc Networks Using Connected Dominating Sets , 2001 .

[34]  Wojciech Rytter,et al.  Deterministic broadcasting in ad hoc radio networks , 2002, Distributed Computing.