Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A novel convex hull-based flooding scheme using 1-hop neighbor information for mobile ad hoc networks

  • 177 Accesses

  • 1 Citations

Abstract

Flooding is one of the most essential and commonly used operations in mobile ad hoc networks. Different sender-based and receiver-based flooding algorithms have been presented separately in the literature. To integrate the advantages of sender-based and receiver-based flooding algorithms, this paper proposes a novel joint 1-hop neighbor information-based flooding scheme that consists of two sub-algorithms: the sender-phase algorithm and the receiver-phase algorithm. The sender-phase algorithm of our flooding scheme helps a node select a subset of its 1-hop neighbors to forward the flooding message. Based on the convex-hull concept, this algorithm selects forwarding nodes with the highest contribution to flooding message dissemination. On the other hand, the receiver-phase algorithm complements the sender-phase algorithm, allowing our flooding scheme to guarantee full delivery. We prove that our flooding scheme requires lower time complexity O(n log h), where h is the number of forwarding nodes, than the best known 1-hop neighbor information-based flooding algorithms proposed by Liu et al. and Khabbazian et al. Additionally, to alleviate the local optimal problem caused by sender-based flooding algorithms, we relax the full delivery requirement and modify our flooding scheme to discard more redundant rebroadcasting operations. Simulation experiments are conducted to compare the performance of our flooding schemes with those of Liu et al.’s and Khabbazian et al.’s flooding algorithms. The simulation results show that our flooding schemes accomplish a lower ratio of broadcasting nodes and a higher message delivery ratio simultaneously under various network conditions. Moreover, since our flooding schemes have lower ratios of broadcasting nodes, they incur fewer packet collisions on the network. Consequently, message disseminations applying our flooding schemes have a smaller effect on other transmissions of different message types.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Notes

  1. 1.

    Following the definitions in [1, 2], the term “flooding” shares the same meaning as the term “broadcasting”. Without any ambiguity, these two terms are used interchangeably throughout this paper.

References

  1. 1.

    Liu, H., Jia, X., Wan, P.-J., Liu, X., & Yao, F. F. (2007). A distributed and efficient flooding scheme using 1-hop information in mobile ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 18, 658–671.

  2. 2.

    Khabbazian, M., & Bhargava, V. K. (2009). Efficient broadcasting in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 8, 231–245.

  3. 3.

    Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Proceedings of the second IEEE workshop on mobile computing systems and applications, WMCSA 1999 (pp. 90–100).

  4. 4.

    Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In T. Imielinski & H. Korth (Eds.), Mobile computing (pp. 153–181). Kluwer.

  5. 5.

    Lee, S. J., Su, W., & Gerla, M. (2002). On-demand multicast routing protocol in multihop wireless mobile networks. Mobile networks and applications, 7, 441–453.

  6. 6.

    Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., & Sheu, J.-P. (1999). The broadcast storm problem in a mobile ad hoc network. In Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking (pp. 151–162).

  7. 7.

    Sasson, Y., Cavin, D., & Schiper, A. (2003). Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In IEEE wireless communications and networking, WCNC 2003 (Vol. 2, pp. 1124–1130).

  8. 8.

    Tseng, Y.-C., Ni, S.-Y., & Shih, E.-Y. (2003). Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network. IEEE Transactions on Computers, 52, 545–557.

  9. 9.

    Khabbazian, M., & Bhargava, V. K. (2008). Localized broadcasting with guaranteed delivery and bounded transmission redundancy. IEEE Transactions on Computers, 57, 1072–1086.

  10. 10.

    Le, T., & Choo, H. (2008). Efficient flooding scheme based on 2-hop backward information in ad hoc networks. In IEEE International Conference on Communications, ICC 2008 (pp. 2443–2447).

  11. 11.

    Lou, W., & Wu, J. (2004). Double-covered broadcast (dcb): A simple reliable broadcast algorithm in manets. In Proceedings of the twenty-third annual joint conference of the IEEE Computer and Communications Societies, INFOCOM 2004 (Vol. 3, pp. 2084–2095).

  12. 12.

    Peng, W., & Lu, X.-C. (2000). On the reduction of broadcast redundancy in mobile ad hoc networks. In Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, MobiHoc 2000 (pp. 129–130).

  13. 13.

    Stojmenovic, I., Seddigh, M., & Zunic, J. (2002). Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 13, 14–25.

  14. 14.

    Qayyum, A., Viennot, L., & Laouiti, A. (2002). Multipoint relaying for flooding broadcast messages in mobile wireless networks. In Proceedings of the 35th annual Hawaii International Conference on System Sciences, HICSS 2002 (pp. 3866–3875).

  15. 15.

    Wu, J., & Dai, F. (2003). Broadcasting in ad hoc networks based on self-pruning. In Proceedings of the twenty-second annual joint conference of the IEEE Computer and Communications, INFOCOM 2003 (Vol. 3, pp. 2240–2250).

  16. 16.

    Wu, J., & Dai, F. (2005). Efficient broadcasting with guaranteed coverage in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 4, 259–270.

  17. 17.

    Dai, F., & Wu, J. (2004). An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 15, 908–920.

  18. 18.

    Wan, P.-J., Alzoubi, K., & Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks. In Proceedings of the twenty-first annual joint conference of the IEEE Computer and Communications Societies, INFOCOM 2002 (Vol. 3, pp. 1597–1604).

  19. 19.

    Cai, Y., Hua, K. A., & Phillips, A. (2005). Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks. In Proceedings of the 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 (pp. 347–354).

  20. 20.

    Yang, C.-C., & Chen, C.-Y. (2002). A reachability-guaranteed approach for reducing broadcast storms in mobile ad hoc networks. In Proceedings of the 56th Vehicular Technology Conference, VTC 2002-Fall (Vol. 2, pp. 1036–1040).

  21. 21.

    Williams, B., & Camp, T. (2002). Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, MobiHoc 2002 (pp. 194–205).

  22. 22.

    He, T., Huang, C., Blum, B. M., Stankovic, J. A., & Abdelzaher, T. (2003). Range-free localization schemes for large scale sensor networks. In Proceedings of the 9th annual international conference on Mobile computing and networking, MobiCom ’03, New York, NY, USA (pp. 81–95). ACM Press.

  23. 23.

    Kirkpatrick, D. G., & Seidel, R. (1986). The ultimate planar convex hull algorithm. SIAM Journal on Computing, 15, 287–299.

  24. 24.

    Chan, T. M. (1996). Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16, 361–368.

  25. 25.

    Jarvis, R. A. (1973). On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters, 2(1), 18–21.

  26. 26.

    Graham, R. L. (1972). An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1(4), 132–133.

  27. 27.

    Heath, T. L. (1956). Euclid the thirteen books of the elements (Euclid, Vol. 2—Books III–IX). Dover Publications.

Download references

Acknowledgments

The authors would like to thank the anonymous reviewers for their valuable comments, which have significantly enhanced the quality of this paper. This work was supported in part by the National Science Council of Taiwan under Contract 97-2219-E-007-004-, and Contract 97-2219-E-007-003-, and in part by Chunghwa Telecom.

Author information

Correspondence to Shun-Ren Yang.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Yang, S., Chiu, C. & Yen, W. A novel convex hull-based flooding scheme using 1-hop neighbor information for mobile ad hoc networks. Wireless Netw 17, 1715 (2011). https://doi.org/10.1007/s11276-011-0374-3

Download citation

Keywords

  • Broadcasting
  • Convex hull
  • Flooding
  • Mobile ad hoc networks
  • Wireless networks