Skip to main content
Erschienen in: Wireless Networks 7/2011

01.10.2011

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

verfasst von: Shun-Ren Yang, Chun-Wei Chiu, Wei-Torng Yen

Erschienen in: Wireless Networks | Ausgabe 7/2011

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
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.
 
Literatur
1.
Zurück zum Zitat 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.CrossRef 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.CrossRef
2.
Zurück zum Zitat Khabbazian, M., & Bhargava, V. K. (2009). Efficient broadcasting in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 8, 231–245.CrossRef Khabbazian, M., & Bhargava, V. K. (2009). Efficient broadcasting in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 8, 231–245.CrossRef
3.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
6.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
9.
Zurück zum Zitat Khabbazian, M., & Bhargava, V. K. (2008). Localized broadcasting with guaranteed delivery and bounded transmission redundancy. IEEE Transactions on Computers, 57, 1072–1086.MathSciNetCrossRef Khabbazian, M., & Bhargava, V. K. (2008). Localized broadcasting with guaranteed delivery and bounded transmission redundancy. IEEE Transactions on Computers, 57, 1072–1086.MathSciNetCrossRef
10.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
14.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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). 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.
Zurück zum Zitat Wu, J., & Dai, F. (2005). Efficient broadcasting with guaranteed coverage in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 4, 259–270.CrossRef Wu, J., & Dai, F. (2005). Efficient broadcasting with guaranteed coverage in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 4, 259–270.CrossRef
17.
Zurück zum Zitat 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.CrossRef 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.CrossRef
18.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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). 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat Kirkpatrick, D. G., & Seidel, R. (1986). The ultimate planar convex hull algorithm. SIAM Journal on Computing, 15, 287–299.MathSciNetMATHCrossRef Kirkpatrick, D. G., & Seidel, R. (1986). The ultimate planar convex hull algorithm. SIAM Journal on Computing, 15, 287–299.MathSciNetMATHCrossRef
24.
Zurück zum Zitat Chan, T. M. (1996). Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16, 361–368.MathSciNetMATHCrossRef Chan, T. M. (1996). Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16, 361–368.MathSciNetMATHCrossRef
25.
Zurück zum Zitat 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.MathSciNetMATHCrossRef 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.MathSciNetMATHCrossRef
26.
Zurück zum Zitat Graham, R. L. (1972). An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1(4), 132–133.MATHCrossRef Graham, R. L. (1972). An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1(4), 132–133.MATHCrossRef
27.
Zurück zum Zitat Heath, T. L. (1956). Euclid the thirteen books of the elements (Euclid, Vol. 2—Books III–IX). Dover Publications. Heath, T. L. (1956). Euclid the thirteen books of the elements (Euclid, Vol. 2—Books III–IX). Dover Publications.
Metadaten
Titel
A novel convex hull-based flooding scheme using 1-hop neighbor information for mobile ad hoc networks
verfasst von
Shun-Ren Yang
Chun-Wei Chiu
Wei-Torng Yen
Publikationsdatum
01.10.2011
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 7/2011
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-011-0374-3

Weitere Artikel der Ausgabe 7/2011

Wireless Networks 7/2011 Zur Ausgabe

Neuer Inhalt