Skip to main content

Routing Using Messengers in Sparse and Disconnected Mobile Sensor Networks

  • Chapter
Advances in Web Intelligence and Data Mining

Part of the book series: Studies in Computational Intelligence ((SCI,volume 23))

  • 641 Accesses

Abstract

Sparse mobile sensor networks, such as those in the applications of ecology forest and modern battlefield, can frequently disconnect. Unfortunately, most existing routing protocols in mobile wireless networks mainly address connected networks, either sparse or dense. In this paper, we study the specific problem for dynamic routing in the sparse and disconnected mobile sensor networks utilizing messengers. We propose two routing discovery protocols: Genetic Fuzzy Straight Line Moving of Messengers (GFSLMM) and Genetic Fuzzy Flexible Sharing Policy of Messengers (GFFSPM). A preliminary simulation shows the efficacy of our protocols.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. “A Survey On Sensor Networks” IEEE Commun. Mag. (ASSC02), 40(8): 102–114, 2002.

    Article  Google Scholar 

  2. Wenrui Zhao, Mostafa Ammar, Ellen Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks” Proceedings of ACM Mobihoc 2004.

    Google Scholar 

  3. David B. Johnson and David A. Maltz. “Dynamic Source Routing in Ad Hoc Wireless Networks”, In Mobile Computing, edited by Tomasz Imielinski and Hank Korth, Chapter 5, pages 153–181, Kluwer Academic Publishers, 1996.

    Google Scholar 

  4. H. Liu, J. Lie, Y. Pan, and Y.-Q. Zhang, “An adaptive genetic fuzzy multi-path routing protocol for wireless ad-hoc networks”, Proc. of SAWN 2005, May, 2005.

    Google Scholar 

  5. R. Shah, S. Roy, S. Jain, and W. Brunette. “Data MULEs: Modeling a three-tier architecture for sparse sensor networks.” In IEEE SNPA Workshop, 2003

    Google Scholar 

  6. C-K Toh. “Ad Hoc Mobile Wireless Networks: Protocols and Systems” 2002 by Prentice Hall PTR

    Google Scholar 

  7. Nisar Hundcwale, Qiong Cheng, Xiaolin Hu, Anu Bourgeois, Alex Zelikovsky. “Autonomous Messenger Based Routing in Disjoint Clusters of Mobile Sensor Networks” Agent Directed Simulation 2006 ADS’06 (in SCS 2006)

    Google Scholar 

  8. http://www.engineer.ucla.edu/stories/2003/nims.htm

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cheng, Q., Zhang, Y., Hu, X., Hundewale, N., Zelikovsky, A. (2006). Routing Using Messengers in Sparse and Disconnected Mobile Sensor Networks. In: Last, M., Szczepaniak, P.S., Volkovich, Z., Kandel, A. (eds) Advances in Web Intelligence and Data Mining. Studies in Computational Intelligence, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33880-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-33880-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33879-6

  • Online ISBN: 978-3-540-33880-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics