This Article 
 Bibliographic References 
 Add to: 
Efficient Broadcasting in Mobile Ad Hoc Networks
February 2009 (vol. 8 no. 2)
pp. 231-245
Majid Khabbazian, University of British Columbia, Vancouver
Vijay K. Bhargava, University of British Columbia, Vancouver
This paper presents two efficient flooding algorithms based on 1-hop neighbor information. In the first part of the paper, we consider sender-based flooding algorithms, specifically the algorithm proposed by Liu et al. In their paper, Liu et al. propose a sender-based flooding algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O(n logn), where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based flooding algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O(n). In Liu's algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. In the second part of the paper we propose a simple and highly efficient receiver-based flooding algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The analytical results are confirmed using simulation.

[1] C. Perkins, Ad Hoc on Demand Distance Vector (AODV) Routing, IETF Internet draft, work in progress, 1997.
[2] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H.F.Korth, eds., Kluwer Academic Publishers, 1996.
[3] S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MobiCom '99, pp. 151-162, 1999.
[4] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1990.
[5] B. Clark, C. Colbourn, and D. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165-177, 1990.
[6] P. Wan, K. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM '02, vol. 3, pp. 1597-1604, 2002.
[7] S. Funke, A. Kesselman, U. Meyer, and M. Segal, “A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs,” ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 444-453, 2006.
[8] H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, “Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, 2006.
[9] Y. Tseng, S. Ni, and E. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Networks,” Proc. 21st Int'l Conf. Distributed Computing Systems (ICDCS '01), pp. 481-488, 2001.
[10] Y. Sasson, D. Cavin, and A. Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '03), pp. 1124-1130, 2003.
[11] W. Lou and J. Wu, “Double-Covered Broadcast (DCB): A Simple Reliable Broadcast Algorithm in Manets,” Proc. IEEE INFOCOM '04, pp. 2084-2095, 2004.
[12] J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. IEEE INFOCOM '03, pp. 2240-2250, 2003.
[13] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc '00, pp. 129-130, 2000.
[14] T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, “Range-Free Localization Schemes in Large Scale Sensor Networks,” Proc. ACM MobiCom '03, pp. 81-95, 2003.
[15] A. Keshavarz-Haddad, V. Ribeiro, and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. Fourth Ann. IEEE Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), June 2007.
[16] R. Wattenhofer, L. Li, P. Bahl, and Y. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless AdHoc Networks,” Proc. IEEE INFOCOM '01, pp. 1388-1397, 2001.
[17] L. Li, J. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, “A Cone-Based Distributed Topology-Control Algorithm for Wireless Multi-Hop Networks,” IEEE/ACM Trans. Networking, vol. 13, pp.147-159, 2005.
[18] M. Sun, W. Feng, and T. Lai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '01), pp. 2842-2846, 2001.
[19] A. Papoulis, Probability and Statistics. Prentice Hall, 1990.
[20] R. Chang and R. Lee, “On the Average Length of Delaunay Triangulations,” BIT Numerical Math., vol. 24, pp. 269-273, 1984.
[21] M. Khabbazian and V.K. Bhargava, “Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy,” IEEE Trans. Computers, vol. 57, no. 8, pp. 1072-1086, Mar. 2008.
[22] Y. Cai, K. Hua, and A. Phillips, “Leveraging 1-Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks,” Proc. 24th IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '05), pp. 347-354, 2005.
[23] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M '99), pp. 7-14, 1999.

Index Terms:
Wireless communication, Network communications, Mobile environments
Majid Khabbazian, Vijay K. Bhargava, "Efficient Broadcasting in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 2, pp. 231-245, Feb. 2009, doi:10.1109/TMC.2008.94
Usage of this product signifies your acceptance of the Terms of Use.