Skip to main content

On the Monitoring Period for Fault-Tolerant Sensor Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3747))

Abstract

Connectivity of a sensor network depends critically on tolerance to node failures. Nodes may fail due to several reasons, including energy exhaustion, material fatigue, environmental hazards or deliberate attacks. Although most routing algorithms for sensor networks have the ability to circumvent zones where nodes have crashed, if too many nodes fail the network may become disconnected.

A sensible strategy for increasing the dependability of a sensor network consists in deploying more nodes than strictly necessary, to replace crashed nodes. Spare nodes that are not fundamental for routing or sensing may go to sleep. To ensure proper operation of the sensor network, sleeping nodes should monitor active nodes frequently. If crashed nodes are not replaced, messages follow sub-optimal routes (which are energy inefficient) and, furthermore, the network may eventually become partitioned due to the effect of accumulated crashes. On the other hand, to save the energy, nodes should remain sleeping as much as possible. In fact, if the energy consumed with the monitoring process is too high, spare nodes may exhaust their batteries (and the batteries of active nodes) before they are needed.

This paper studies the optimal monitoring period in fault-tolerant sensor networks to ensure that: i) the network remains connected (i.e., crashed nodes are detected and substituted fast enough to avoid the network partition) and, ii) the lifetime of the network is maximized (i.e., inactive nodes save as much battery as possible).

This work was partially supported by the LaSIGE and by the FCT project P-SON POSC/EIA/60941/2004 via POSI and FEDER funds.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The ns Manual, http://www.isi.edu/nsnam/ns/ns-documentation

  2. Bhardwaj, M., Chandrakasan, A., Garnett, T.: Upper bounds on the lifetime of sensor networks. In: IEEE International Conference on Communications, pp. 785–790 (2001)

    Google Scholar 

  3. Blough, D., Santi, P.: Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks. In: ACM Mobicom (2002)

    Google Scholar 

  4. Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 48–55 (1999)

    Google Scholar 

  5. Calinescu, G., Mandoiu, I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: 17th IFIP World Computer Congress, pp. 119–130 (2002)

    Google Scholar 

  6. Chang, J., Tassiulas, L.: Routing for maximum system lifetime in wireless ad-hoc networks. In: 37-th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL (September 1999)

    Google Scholar 

  7. Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: INFOCOM (1), pp. 22–31 (2000)

    Google Scholar 

  8. Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wireless Networks 8(5), 481–494 (2002)

    Article  MATH  Google Scholar 

  9. Chen, G., Stojmenovic, I.: Clustering and routing in wireless ad hoc networks. Technical Report TR-99-05, Department of Computer Science, SITE, University of Ottawa, Ottawa, Ontario K1N 6N5, Canada (June 1999)

    Google Scholar 

  10. Chessa, S., Santi, P.: Crash faults identification in wireless sensor networks. Computer Communications 45(2), 126–143 (2002)

    MATH  MathSciNet  Google Scholar 

  11. Datta, A.: Fault-tolerant and energy-efficient permutation routing protocol for wireless networks. In: International Parallel and Distributed Processing Symposium, IPDPS 2003 (2003)

    Google Scholar 

  12. Feeney, L.M., Nilsson, M.: Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In: IEEE INFOCOM (2001)

    Google Scholar 

  13. Hajiaghayi, M., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In: Proceedings of the 9th annual international conference on Mobile computing and networking, pp. 300–312. ACM Press, New York (2003)

    Chapter  Google Scholar 

  14. Jain, R., Puri, A., Sengupta, R.: Geographical routing using partial information for wireless ad hoc networks. IEEE Personal Communication, 48–57 (February 2001)

    Google Scholar 

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

    Google Scholar 

  16. Karp, B., Kung, H.T.: GPRS: Greedy perimeter stateless routing for wireless networks. In: ACM/IEEE International Conference on Mobile Computing and Networking (2000)

    Google Scholar 

  17. Li, X.-Y., Wan, P.-J., Wang, Y., Yi, C.-W.: Fault tolerant deployment and topology control in wireless networks. In: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pp. 117–128. ACM Press, New York (2003)

    Chapter  Google Scholar 

  18. Perkins, C.: Ad-hoc on-demand distance vector routing (1997)

    Google Scholar 

  19. Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: ACM SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, pp. 234–244 (1994)

    Google Scholar 

  20. Raghunathan, V., Schurgers, C., Park, S., Srivastava, M.B.: Energy-aware wireless microsensor networks. IEEE Signal Processing Magazine, 40–50 (March 2002)

    Google Scholar 

  21. Rodoplu, V., Meng, T.: Minimum energy mobile wireless networks. In: 1998 IEEE International Conference on Communications, ICC 1998, Atlanta, GA, vol. 3, pp. 1633–1639 (June 1998)

    Google Scholar 

  22. Singh, S., Raghavendra, C.: Pamas: Power aware multi-access protocol with signalling for ad hoc networks. ACM Computer Communication Review (July 1998)

    Google Scholar 

  23. Stemm, M., Katz, R.H.: Measuring and reducing energy consumption of network interfaces in hand-held devices. IEICE Transactions on Communications E80-B(8), 1125–1131 (1997)

    Google Scholar 

  24. Stojmenovic, I.: Position-based routing in ad hoc networks. IEEE Communications Magazine (July 2002)

    Google Scholar 

  25. Stojmenovic, I., Lin, X.: Power-aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems 12(11), 1122–1133 (2001)

    Article  Google Scholar 

  26. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: SenSys 2003: Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 28–39. ACM Press, New York (2003)

    Chapter  Google Scholar 

  27. Wang, Y., Li, X.-Y.: Geometric spanners for wireless ad hoc networks. In: The 22nd IEEE International Conference on Distributed Computing Systems (2002)

    Google Scholar 

  28. Wu, J., Wu, B., Stojmenovic, I.: Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. Wireless Communications and Mobile Computing 4(1), 425–438 (2003)

    Article  Google Scholar 

  29. Xu, Y., Bien, S., Mori, Y., Heidemann, J., Estrin, D.: Topology control protocols to conserve energy inwireless ad hoc networks. Technical Report 6, University of California, Los Angeles, Center for Embedded Networked Computing, submitted for publication (January 2003)

    Google Scholar 

  30. Xu, Y., Heidemann, J.S., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: Mobile Computing and Networking, pp. 70–84 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Araújo, F., Rodrigues, L. (2005). On the Monitoring Period for Fault-Tolerant Sensor Networks. In: Maziero, C.A., Gabriel Silva, J., Andrade, A.M.S., de Assis Silva, F.M. (eds) Dependable Computing. LADC 2005. Lecture Notes in Computer Science, vol 3747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572329_15

Download citation

  • DOI: https://doi.org/10.1007/11572329_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29572-3

  • Online ISBN: 978-3-540-32092-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics