Reactive Networks

Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 92)

Abstract

Networks strive to keep “all” of their nodes connected. However, is this really necessary? Do we actually need to “continuously” maintain routes from and to “any” possible destination? This chapter looks at networks that can discern between active and non-active paths. The idea is to care for the nodes that are actively intercommunicating, leaving the rest of the network in standby mode. In this chapter, we will explore on-demand routing, one of the key ingredients that can make networks more reactive on a larger scale.

Keywords

Reactive Network Garbage Collection Table Entry Sequence Counter Reverse Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Hekmat R (2006) Ad-hoc networks: fundamental properties and network topologies. SpringerGoogle Scholar
  2. 2.
    Wang G (2008) Mac layer and routing protocols for heterogeneous Ad-hoc Networks. VDM Verlag Dr Muller Aktiengesellschaft Co KGGoogle Scholar
  3. 3.
    Sarkar SK, Basavaraju TG, Puttamadappa C (2007) Ad hoc mobile wireless networks. CRCGoogle Scholar
  4. 4.
    Mian A, Baldoni R, Beraldi R (2009) A survey of service discovery protocols in multihop mobile Ad-hoc networks. Pervasive Comput IEEE 8:66–74CrossRefGoogle Scholar
  5. 5.
    Tonguz O, Ferrari G (2006) Ad Hoc wireless networks: a communication-theoretic perspective. Wiley BlackwellGoogle Scholar
  6. 6.
    Mueller A (2007) Efficient wireless mac protocols-analyzing quality of service in wireless networks. VDM Verlag Saarbrücken, GermanyGoogle Scholar
  7. 7.
    Perkins C (2003) Ad hoc on-demand distance vector routing (RFC 3561). 37 pp. http://www.ietf.org/rfc/rfc3561.txt
  8. 8.
    Perkins C, Royer E (1999) Ad-hoc on-demand distance vector routing. IEEE workshop on mobile computing systems and applications, pp 90–100Google Scholar
  9. 9.
    Royer E, Perkins C (2000) An implementation study of the AODV routing protocol. IEEE Conf Wireless Commun Netw 3:1003–1008Google Scholar
  10. 10.
    Das S, Perkins C, Royer E (2000) Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE INFOCOM 2000 1:3–12Google Scholar
  11. 11.
    Gwalani S, Belding-Royer E, Perkins C (2003) AODV-PA: AODV with path accumulation. IEEE Int Conf Commun 1:527–531CrossRefGoogle Scholar
  12. 12.
    Qadri N, Liotta A (2009) Analysis of pervasive mobile ad hoc routing protocols. pervasive computing: innovations in intelligent multimedia and applications. Springer, Berlin, pp 433–453Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.Department of Electrical EngineeringEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations