Skip to main content

Probabilistic Routing in Intermittently Connected Networks

  • Conference paper
Service Assurance with Partial and Intermittent Resources (SAPIR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3126))

Abstract

In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.

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. Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000)

    Google Scholar 

  2. Glance, N., Snowdon, D., Meunier, J.L.: Pollen: using people as a communication medium. Computer Networks 35, 429–442 (2001)

    Article  Google Scholar 

  3. Chen, X., Murphy, A.L.: Enabling disconnected transitive communication in mobile ad hoc networks. In: Proc. of Workshop on Principles of Mobile Computing, colocated with PODC 2001, Newport, RI (USA), pp. 21–27 (2001)

    Google Scholar 

  4. Shen, C.C., Borkar, G., Rajagopalan, S., Jaikaeo, C.: Interrogation-based relay routing for ad hoc satellite networks. In: Proceedings of IEEE Globecom 2002, Taipei, Taiwan (2002)

    Google Scholar 

  5. Lindgren, A., Doria, A., Schelén, O.: Poster: Probabilistic routing in intermittently connected networks. In: Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003) (2003)

    Google Scholar 

  6. Doria, A., Udén, M., Pandey, D.P.: Providing connectivity to the saami nomadic community. In: Proceedings of the 2nd International Conference on Open Collaborative Design for Sustainable Innovation (dyd 02), Bangalore, India (2002)

    Google Scholar 

  7. Pentland, A., Fletcher, R., Hasson, A.A.: A road to universal broadband connectivity. In: Proceedings of the 2nd International Conference on Open Collaborative Design for Sustainable Innovation (dyd 02), Bangalore, India (2002)

    Google Scholar 

  8. Boehlert, G.W., Costa, D.P., Crocker, D.E., Green, P., O’Brien, T., Levitus, S., Boeuf, B.J.L.: Autonomous pinniped environmental samplers; using instrumented animals as oceanographic data collectors. Journal of Atmospheric and Oceanic Technology 18(11), 1882–1893 (2001)

    Article  Google Scholar 

  9. Small, T., Haas, Z.: The shared wireless infostation model - a new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pp. 233–244 (2003)

    Google Scholar 

  10. Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.S., Rubenstein, D.: Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In: Proceedings of Tenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), San Jose, CA (2002)

    Google Scholar 

  11. Beaufour, A., Leopold, M., Bonnet, P.: Smart-tag based data dissemination. In: First ACM InternationalWorkshop onWireless Sensor Networks and Applications (WSNA 2002) (2002)

    Google Scholar 

  12. Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, Korth (eds.) Mobile Computing. vol. 353, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  13. Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. In: Proceedings of The Fourth ACM International Symposium onMobile Ad Hoc Networking and Computing (MobiHoc 2003) (2003)

    Google Scholar 

  14. Nain, D., Petigara, N., Balakrishnan, H.: Integrated routing and storage for messaging applications in mobile ad hoc networks. In: Proceedings of WiOpt 2003:Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Sophia-Antipolis, France (2003)

    Google Scholar 

  15. Li, Q., Rus, D.: Communication in disconnected ad-hoc networks using message relay. Journal of Parallel and Distributed Computing (2003)

    Google Scholar 

  16. Grossglauser, M., Tse, D.: Mobility increases the capacity of ad-hoc wireless networks. IEEE/ACMTransactions on Networking 10 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lindgren, A., Doria, A., Schelén, O. (2004). Probabilistic Routing in Intermittently Connected Networks. In: Dini, P., Lorenz, P., de Souza, J.N. (eds) Service Assurance with Partial and Intermittent Resources. SAPIR 2004. Lecture Notes in Computer Science, vol 3126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27767-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27767-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27767-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics