This Article 
 Bibliographic References 
 Add to: 
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
October 2004 (vol. 53 no. 10)
pp. 1343-1354
Jie Wu, IEEE
Fei Dai, IEEE
We propose a generic framework for distributed broadcasting in ad hoc wireless networks. The approach is based on selecting a small subset of nodes to form a forward node set to carry out a broadcast process. The status of each node, forward or nonforward, is determined either by the node itself or by other nodes. Node status can be determined at different snapshots of network state along time (called views) without causing problems in broadcast coverage. Therefore, the forward node set can be constructed and maintained through either a proactive process (i.e., "up-to-date”) before the broadcast process or a reactive process (i.e., "on-the-fly”) during the broadcast process. A sufficient condition, called coverage condition, is given for a node to take the nonforward status. Such a condition can be easily checked locally around the node. Several existing broadcast algorithms can be viewed as special cases of the generic framework with k{\hbox{-}}\rm hop neighborhood information. A comprehensive comparison among existing algorithms is conducted. Simulation results show that new algorithms, which are more efficient than existing ones, can be derived from the generic framework.

[1] S. Alagar, S. Venkatesan, and J. Cleveland, “Reliable Broadcast in Mobile Wireless Networks,” Military Comm. Conf., MILCOM Conf. Record, vol. 1, pp. 236-240, 1995.
[2] K.M. Alzoubi, P.-J. Wan, and O. Frieder, Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks J. Comm. and Networks, vol. 4, no. 1, pp. 22-29, Mar. 2002.
[3] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks ACM Wireless Networks J., vol. 8, no. 5, pp. 481-494, Sept. 2002.
[4] F. Dai and J. Wu, "Distributed Dominant Pruning in Ad Hoc Networks," Proc. IEEE 2003 Int'l Conf. Communications (ICC 2003), IEEE Press, 2003, pp. 353-357.
[5] S. Guha and S. Khuller, Approximation Algorithms for Connected Dominating Sets Algorithmica, vol. 20, no. 4, pp. 374-387, Apr. 1998.
[6] Z.J. Haas and J.Y. Halpen, Gossip-Based Ad Hoc Routing Proc. IEEE INFOCOM 2002, June 2002.
[7] H. Lim and C. Kim, Flooding in Wireless Ad Hoc Networks Computer Comm. J., vol. 24, nos. 3-4, pp. 353-363, 2001.
[8] C.R. Lin and M. Gerla, “Adaptive Clustering in Mobile Wireless Networks,” IEEE J. Selected Areas in Communications, vol. 16, pp. 1,265–1,275, 1997.
[9] W. Lou and J. Wu, "On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks," IEEE Trans. Mobile Computing, vol. 1, no. 2, 2002, pp. 111-123.
[10] E. Pagani and G.P. Rossi, Providing Reliable and Fault-Tolerant Broadcast Delivery in Mobile Ad Hoc Networks Mobile Networks and Applications, vol. 4, pp. 175-192, 1999.
[11] W. Peng and X.-C. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. First Ann. Workshop Mobile and Ad Hoc Networking and Computing, pp. 129-130, Aug. 2000.
[12] W. Peng and X. Lu, AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks J. Science and Technology, 2002.
[13] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Message in Mobile Wireless Networks,” Proc. Hawaii Int'l Conf. System Sciences '35, Jan. 2002.
[14] V. Ramasubramanian, R. Chandra, and R. Mosse, Providing a Bidirectional Abstraction for Unidirectional Ad Hoc Networks Proc. INFOCOM '02, vol. 3, pp. 1258-1267, 2002.
[15] I. Stojmenovic, S. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[16] J. Sucec and I. Marsic, An Efficient Distributed Network-Wide Broadcast Algorithm for Mobile Ad Hoc Networks CAIP Technical Report 248, Rutgers Univ., Sept. 2000.
[17] Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, The Broadcast Storm Problem in a Mobile Ad Hoc Network Wireless Networks, vol. 8, nos. 2/3, pp. 153-167, Mar.-May 2002.
[18] J. Wu and F. Dai, Broadcasting in Ad Hoc Networks Based on Self-Pruning Int'l J. Foundations of Computer Science, vol. 14, no. 2, pp. 201-221, Apr. 2003.
[19] J. Wu and H. Li, On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7-14, 1999.
[20] J. Wu and W. Lou, Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks Wireless Comm. and Mobile Computing, special issue on algorithmic,geometric, graph, combinatorial, and vector, vol. 3, no. 2, pp. 155-173, 2003.

Index Terms:
Ad hoc wireless networks, broadcasting, distributed algorithms, pruning.
Jie Wu, Fei Dai, "A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks," IEEE Transactions on Computers, vol. 53, no. 10, pp. 1343-1354, Oct. 2004, doi:10.1109/TC.2004.69
Usage of this product signifies your acceptance of the Terms of Use.