Skip to main content
Log in

An autonomic routing framework for sensor networks

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Current routing services for sensor networks are often designed for specific applications and network conditions, thus have difficulty in adapting to application and network dynamics. This paper proposes an autonomic framework to promote the adaptivity of routing services in sensor networks. The key idea of this framework is to maintain some feature functions that are decoupled from originally-integrated routing services. This separation enables significant service changes to be done by only tuning these functions. Measures including parameterization are taken to save the energy for changing these functions. Further, this framework includes a monitoring module to support a policy-based collaborative adaptation. This paper shows an example autonomic routing service conforming to this framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Hill et al., System architecture directions for networked sensors, In: ASPLOS (November 2000).

  2. K. Pister et al., Smart dust: wireless networks of milimeter-scale sensor nodes, Highlight Article in 1999 Electronics Research Laboratory Research Summary (1999).

  3. G. Pottie et al., Wireless sensor networks. Communications of the ACM (2000).

  4. D. Estrin, R. Govindan et al., Next century challenges: scalable coordination in sensor networks, In: Mobicom (August 1999).

  5. D. Estrin, L. Girod et al., Instrumenting the world with wireless sensor networks. ICASSP (May 2001).

  6. J.M. Kahn et al., Mobile networking for smart dust, Mobicom (August 1999).

  7. J. Cerpa, D. Estrin et al., Habitat monitoring: application driver for wireless communications technology, ACMSIGCOMM Workshop on Data Communications in Latin America and the Caribbean (April 2001).

  8. L. Girod, D. Estrin et al., Robust range estimation using acoustic and multimodal sensing, IEEE Conference on Intelligent, Robots and Systems (2001).

  9. B. Karp and H.T. Kung, Gpsr: Greedy perimeter stateless routing for wireless networks, Mobicom (2000).

  10. D. Braginsky and D. Estrin, Rumor routing algorithm for sensor networks, WSNA (September 2002).

  11. F. Ye, H. Luo, J. Cheng, S. Lu and L. Zhang, A two-tier data dissemination model for large-scale wireless sensor networks, Mobicom (September 2002).

  12. A. Ganek et al., Autonomic computing: Ibm's perspective on the state of information technology, http://www.research.ibm.com/autonomic/manifesto/ (October 2001).

  13. Y. Yu, R. Govindan and D. Estrin, Geographical and energy aware routing: a recursive data dissmination protocol for wireless sensor networks, UCLA CS Tech. Report (2001).

  14. D. Niculescu and B. Nath, Trajectory based forwarding and its applications, Mobicom (September 2003).

  15. C. Intanagonwiwat, R. Govindan and D. Estrin, Directed diffusion: A scalabel and robust communication paradigm for sensor networks, Mobicom (2000).

  16. H. Zhou and S. Singh, Content-based multicast for mobile ad hoc networks, Mobihoc (August 2000).

  17. B. Nath and D. Niculescu, Routing on a curve, Hotnets I (October 2002).

  18. J. Moy, Rfc 2328 - ospf version 2, Request for Comments (April 1998).

  19. C. Hedrick, Rfc 1058 - routing information protocol, Request for Comments (June 1988).

  20. D. B. Johnson et al., The dynamic source routing protocol for mobile ad-hoc networks, IETF Internat Draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-99.txt (2003).

  21. C.E. Perkins, E.M. Royer and S.R. Das, Ad hoc on-demand distance vector (aodv) routing (2003), http://www.ietf.org/rfc/rfc3561.txt..

  22. S.R. Madden, R. Szewczyk, M.J. Franklin and D. Culler, Supporting aggregate queries over ad-hoc wireless sensor networks, WMCSA (June 2002).

  23. Y. He and C.S. Raghavendra, Building programmable routing services for sensor networks, Journal of Computer Communications, to appear.

  24. D. A. Wheeler, Program library howto, http://www.tldp.org/HOWTO/Program-Library-HOWTO/ (December 2002).

  25. Y.-H. Chang, T. Ho et al, Mobilized ad-hoc networks: A reinforcement learning approach, ICAC (2004).

  26. Y. He and C.S. Raghavendra, Xvr: X visiting-pattern routing for sensor networks, Submitted (2004).

  27. J. Hill and D. Culler, A wireless embedded sensor architecture for system-level optimization, Intel Research IRB-TR-02-00N (2002).

  28. ipaq 3670, http://thenew.hp.com/..

  29. D.A. Wheeler, Program library howto, http://www.tldp.org/HOWTO/Program-Library-HOWTO/ (December 2002).

  30. D.L. Tenenhouse and D.J. Wetherall, Towards an active network architecture, Computer Communication Review (April 1996).

  31. D.L. Tenenhouse, J.M. Smith, W.D. Sincoskie, D.J. Wetherall and G. Minden, A survey of active network research, IEEE Communication Magazine (January 1997).

  32. L. Peterson et al., An os interface for active routers. IEEE J-SAC, 19(3) (March 2001) 473-487.

  33. D. Decasper, Z. Dittia, G. Parulkar and B. Plattner, Router plugins: A software architecture for next generation routers. IEEE/ACM Transactions on Networking, 8(1) (Februray 2000) 2–15.

    Google Scholar 

  34. E. Kohler et al., The click modular router, ACM Transactions on Computer Systems, 18(3) (August 2000) 263–297.

    Article  Google Scholar 

  35. Intel Corporation. Ixp 1200 network processor datasheet (September 2000).

  36. Y. Gottlieb and L. Peterson, A comparative study of extensible routers, IEEE OPENARCH (June 2002).

  37. J. Heidemann, F. Silva et al., Building efficient wireless sensor networks with low-level naming, SOSP (October 2001).

  38. J. Heidemann, F. Silva et al., Diffusion filters as a flexible architecture for event notification in wireless sensor networks, USC/ISI Tech. Report (April 2002).

  39. F. Silva, J. Heidemann et al., Network routing application programmer's interface (api) and walk through 9.0.1, http://www.isi.edu/scadds/papers/ (December 2002).

  40. P. Levis and D. Culler, Maté: A tiny virtual machine for sensor networks, ASPLOS X (October 2002).

  41. A. Boulis and M.B. Srivastava, A framework for efficient and programmable sensor networks, OPENARCH (July 2002).

  42. A. Boulis, C.-C. Han and M.B. Srivastava, Design and implementation of a framework for efficient and programmable sensor networks, MobiSys (May 2003).

  43. T. Liu et al., Impala: A middleware system for managing autonomic, parallel sensor systems, PPoPP (2003).

  44. J. Boyan and M.L. Littman, Packet routing in dynamically changing networks: A reinforcement learning approach, Advances in NIPS (1994).

  45. C.J. Watkins, Reinforcement learning by delayed rewards, Ph.D. Thesis, Univ. of Cambridge (1989).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cauligi S. Raghavendra.

Additional information

Some of this work was done while the author was at ISI

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, Y., Raghavendra, C.S., Berson, S. et al. An autonomic routing framework for sensor networks. Cluster Comput 9, 191–200 (2006). https://doi.org/10.1007/s10586-006-7563-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-006-7563-3

Keywords

Navigation