Skip to main content

A Stable Linked Structure Flooding for Mobile Ad Hoc Networks with Fault Recovery

  • Conference paper
Wired/Wireless Internet Communications (WWIC 2010)

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

Included in the following conference series:

  • 1221 Accesses

Abstract

Efficient message dissemination in ad hoc networks can be fostered by exploiting stable (sub-)structures. By efficient we mean low network resource usage regarding reachability. In this paper we build a hierarchical protocol. We first create single-hop clusters among stable-connected devices. On top of those clusters, we further determine inter-cluster relays (ICR), finally providing an overall stable-connected structure. Our proposed stable linked structure flooding (SLSF) protocol efficiently disseminates data among stable nodes. Additional fault recovery mechanisms are employed to compensate for local intermittent node failures if needed. The experiments show that our approach increases flooding performances with a low bandwidth usage. Furthermore SLSF remains very efficient with or without the fault recovery mechanism that provides robustness.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Dousse, O., Thiran, P., Hasler, M.: Connectivity in ad-hoc and hybrid networks. In: IEEE Infocom 2002, pp. 1079–1088 (2002)

    Google Scholar 

  2. Paolo, S.: Topology control in wireless ad hoc and sensor networks. ACM Comput. Surv. 37(2) (2005)

    Google Scholar 

  3. Leclerc, T., Ciarletta, L., Schaff, A.: SLSF: stable linked structure flooding for mobile ad hoc networks. In: IEEE ISWPC, Palazzo Ducale, Modena, Italy (2010)

    Google Scholar 

  4. Andronache, A., Rothkugel, S.: Nlwca node and link weighted clustering algorithm for backbone-assisted mobile ad hoc networks. In: ICN ’08. IEEE, Los Alamitos (2008)

    Google Scholar 

  5. Andronache, A., Rothkugel, S.: Hytrace backbone-assisted path discovery in hybrid networks. In: CTRQ ’08, pp. 34–40. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  6. Optimized link state routing protocol (olsr), rfc3626 (2003)

    Google Scholar 

  7. Adjih, C., Jacquet, P., Viennot, L.: Computing connected dominated sets with multipoint relays. Research Report RR-4597, INRIA (2002)

    Google Scholar 

  8. Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: The broadcast storm problem in a mobile ad hoc network. In: MobiCom ’99. ACM Press, New York (1999)

    Google Scholar 

  9. Haas, Z.J., Pearlman, M.R., Samar, P.: The zone routing protocol (zrp) for ad hoc networks. Technical report (July 2002)

    Google Scholar 

  10. Foroozan, F., Tepe, K.: A high performance cluster-based broadcasting algorithm for wireless ad hoc networks based on a novel gateway selection approach. In: PE-WASUN ’05, pp. 65–70. ACM, New York (2005)

    Chapter  Google Scholar 

  11. Peng, W., Lu, X.: Ahbp: An efficient broadcast protocol for mobile ad hoc networks. Journal of Computer Science and Technology 16(2) (2001)

    Google Scholar 

  12. Lou, W., Wu, J.: Double-covered broadcast (dcb): a simple reliable broadcast algorithm in manets. In: INFOCOM 2004, vol. 3 (2004)

    Google Scholar 

  13. Jacquet, P., et al.: Performance analysis of OLSR multipoint relay flooding in two ad hoc wireless network models. RSRCP, Special issue on Mobility and Internet (2001)

    Google Scholar 

  14. Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS Journal of Communications and Networks 4, 59–70 (2002)

    Google Scholar 

  15. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and manets. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 329–369. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  16. Leclerc, T., Ciarletta, L., Andronache, A., Rothkugel, S.: Olsr and wcpd as basis for service discovery in manets. In: UBICOMM ’08. IEEE, Los Alamitos (2008)

    Google Scholar 

  17. Gorgen, D., Frey, H., Hiedels, C.: Jane-the java ad hoc network development environment. In: ANSS ’07. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  18. Blažević, L., Giordano, S., Le Boudec, J.Y.: Self organized terminode routing. Cluster Computing 5(2) (2002)

    Google Scholar 

  19. Zeroconf: Zerconf, http://www.zeroconf.org/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leclerc, T., Ciarletta, L., Schaff, A. (2010). A Stable Linked Structure Flooding for Mobile Ad Hoc Networks with Fault Recovery. In: Osipov, E., Kassler, A., Bohnert, T.M., Masip-Bruin, X. (eds) Wired/Wireless Internet Communications. WWIC 2010. Lecture Notes in Computer Science, vol 6074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13315-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13315-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics