Skip to main content

Autonomic Information Diffusion in Intermittently Connected Networks

  • Chapter
  • First Online:
Autonomic Computing and Networking

Abstract

In this work, we introduce a framework for designing autonomic information diffusion mechanisms in intermittently connected wireless networks. Our approach is based on the use of techniques and tools drawn from evolutionary computing research, which enable to embed evolutionary features in epidemic-style forwarding mechanisms. In this way, it is possible to build a system in which information dissemination strategies change at runtime to adapt to the current network conditions in a distributed autonomic fashion. A case study is then introduced, for which design and implementation choices are presented and discussed. Simulation results are reported to validate the ability of the proposed protocol to converge to the optimal operating point (or close to it) in unknown and changing environments.

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. Alouf S, Carreras I, Miorandi D, Neglia G (2007) Embedding evolution in epidemic-style forwarding. In: Proc. of IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS 2007), Pisa, Italy

    Google Scholar 

  2. Babaoglu O, Canright G, Deutsch A, Caro GAD, Ducatelle F, Gambardella LM, Ganguly N, Jelasity M, Montemanni R, Montresor A, Urnes T (2006) Design patterns from biology for distributed computing. ACM Trans Auton Adapt Syst 1(1):26–66

    Article  Google Scholar 

  3. Fall K (2003) A delay-tolerant network architecture for challenged Internets. In: Proc. of ACM SIGCOMM 2003, ACM, New York, USA, pp 27–34

    Google Scholar 

  4. Groenevelt R, Nain P, Koole G (2005) The message delay in mobile ad hoc networks. Performance Evaluation 62(1–4):210–228

    Google Scholar 

  5. Grossglauser M, Tse D (2002) Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans on Networking 10(4):477–486

    Article  Google Scholar 

  6. Haas ZJ, Small T (2006) A new networking model for biological applications of ad hoc sensor networks. IEEE/ACM Trans on Networking 14(1):27–40

    Article  Google Scholar 

  7. Lindgren A, Doria A, Schelen O (2004) Probabilistic routing in intermittently connected networks. In: Proc of SAPIR Workshop 2004, LNCS, vol 3126, pp 239–254

    Google Scholar 

  8. Neglia G, Zhang X (2006) Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study. In: Proc of ACM SIGCOMM CHANTS 2006, pp 237–244

    Google Scholar 

  9. OMNeT (2007) OMNeT++ Discrete Event Simulation System. http://www.omnetpp.org

  10. Pelusi L, Passarella A, Conti M (2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Comm Mag 44(11):134–141

    Article  Google Scholar 

  11. Royer EM, Melliar-Smith PM, Moser LE (2001) An analysis of the optimum node density for ad hoc mobile networks. In: Proc. of IEEE ICC 2001, vol 3, pp 857–861

    Google Scholar 

  12. Spyropoulos T, Psounis K, Raghavendra CS (2008) Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans on Networking 16(1): 77–90

    Article  Google Scholar 

  13. Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Tech Rep CS-200006, Duke University

    Google Scholar 

  14. Zhang X, Neglia G, Kurose J, Towsley D (2007) Performance modeling of epidemic routing. Computer Networks 51(10):2867–2891

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sara Alouf .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag US

About this chapter

Cite this chapter

Alouf, S., Carreras, I., Fialho, Á., Miorandi, D., Neglia, G. (2009). Autonomic Information Diffusion in Intermittently Connected Networks. In: Zhang, Y., Yang, L., Denko, M. (eds) Autonomic Computing and Networking. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-89828-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-89828-5_17

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-89827-8

  • Online ISBN: 978-0-387-89828-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics