Skip to main content

Triangular Tiling-Based Efficient Flooding Scheme in Wireless Ad Hoc Networks

  • Conference paper
Management Enabling the Future Internet for Changing Business and New Computing Services (APNOMS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5787))

Included in the following conference series:

  • 938 Accesses

Abstract

Flooding is an indispensable operation for providing control or routing functionalities to wireless ad hoc networks. The traditional flooding scheme generates excessive packet retransmissions, resource contention, and collisions since every node forwards the packet at least once. Recently, several flooding schemes have been proposed to avoid these problems; however, these flooding schemes still have unnecessary forwarding nodes. In this paper, we present an efficient flooding scheme to minimize the number of forwarding nodes, based on a triangular tiling algorithm. Using location information of 1-hop neighbor nodes, our proposed scheme selects the nodes which are located closest to the vertices of an equilateral triangle which is inscribed in the transmission coverage as forwarding nodes. The most significant feature of our proposed flooding scheme is that it does not require any extra communication overhead other than the exchange of 1-hop HELLO messages. Simulation results show that our proposed scheme is so efficient that it has the capability to reduce the number of forwarding nodes such that it approaches the lower bound, hence, it alleviates contention and collisions in networks.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Woo, S., Hong, J., Kim, H.: Modeling and Simulation Framework for Assessing Interference in Multi-Hop Wireless Ad Hoc Networks. KSII Trans. Internet and Information Systems 3(1), 26–51 (2009)

    Article  Google Scholar 

  2. Ho, C., Obraczka, K., Tsudik, G., Johnson, D.: Flooding for Reliable Multicast in Multihop Ad Hoc Networks. In: Proc. Int’l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 64–71 (1999)

    Google Scholar 

  3. Jetcheva, J., Hu, Y., Maltz, D., Johnson, D.: A Simple Protocol for Multicast and Broadcast in Mobile Ad Hoc Networks (2001) Internet Draft: draft-ieft-manet-simple-mbcast-01.txt

    Google Scholar 

  4. Ni, S., Tseng, Y., Chen, Y., Sheu, J.: The broadcast storm problem in a mobile ad hoc network. In: Proc. ACM/IEEE MOBICOM, pp. 151–162 (1999)

    Google Scholar 

  5. Shin, M., Arbaugh, W.A.: Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks. KSII Trans. Internet and Information Systems 3(1), 5–25 (2009)

    Article  Google Scholar 

  6. Cai, Y., Hua, K.A., Phillips, A.: Leveraging 1-Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks. In: Proc. 24th IEEE Int’l Performance Computing and Communications, IPCCC (2005)

    Google Scholar 

  7. Dai, F., Wu, J.: An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE Trans. Parallel and Distributed Systems 15(10), 908–920 (2004)

    Article  Google Scholar 

  8. Wu, J., Lou, W., Dai, F.: Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs. IEEE Trans. Computers 55(3), 334–347 (2006)

    Article  Google Scholar 

  9. Liu, H., Jia, X., Wan, P.J., Liu, X., Yao, F.F.: A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks. IEEE Trans. Parallel and Distributed System 18(5), 658–671 (2007)

    Article  Google Scholar 

  10. Le, T.D., Choo, H.: Efficient Flooding Scheme Based on 2-Hop Backward Information in Ad Hoc Networks. In: Proc. IEEE Int’l Conf. on Communications (ICC), pp. 2443–2447 (2008)

    Google Scholar 

  11. The Network Simulator, www.isi.edu/nsnam/ns (cited on 10th May, 2007)

  12. Meguerdichian, S., Slijepcevic, S., Karayan, V., Potkonjak, M.: Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure. In: Proc. 2nd ACM international symposium on Mobile ad hoc networking & computing, pp. 4–5 (2001)

    Google Scholar 

  13. Bulusu, N., Heidemann, J., Estrin, D., Tran, T.: Self-configuring localization systems: Design and Experimental Evaluation. ACM Trans. Embedded Computing Systems (TECS) 3(1), 24–60 (2004)

    Article  Google Scholar 

  14. Wan, P.J., Alzoubi, K., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. In: Proc. 21st IEEE INFOCOM, pp. 1597–1604 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hur, I., Le, T.D., Jo, M., Choo, H. (2009). Triangular Tiling-Based Efficient Flooding Scheme in Wireless Ad Hoc Networks. In: Hong, C.S., Tonouchi, T., Ma, Y., Chao, CS. (eds) Management Enabling the Future Internet for Changing Business and New Computing Services. APNOMS 2009. Lecture Notes in Computer Science, vol 5787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04492-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04492-2_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04491-5

  • Online ISBN: 978-3-642-04492-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics