Fault-tolerant Coverage in Dense Wireless Sensor Networks

Akshaye Dhawan, Magdalena Parks


In this paper, we present methods to detect and recover from sensor failure in dense wireless sensor networks. In order to extend the lifetime of a sensor network while maintaining coverage, a minimal subset of the deployed sensors are kept active while the other sensors can enter a low power sleep state. Several distributed algorithms for coverage have been proposed in the literature. Faults are of particular concern in coverage algorithms since sensors go into a sleep state in order to conserve battery until woken up by active sensors. If these active sensors were to fail, this could lead to lapses in coverage that are unacceptable in critical applications. Also, most algorithms in the literature rely on an active sensor that is about to run out of battery waking up its neighbors to trigger a reshuffle in the network. However, this would not work in the case of unexpected failures since a sensor cannot predict the occurrence of such an event. We present detection and recovery from sensor failure in dense networks. Our algorithms exploit the density in the recover scheme. The fault tolerance comes at a small cost to the network lifetime with observed lifetime being reduced by 6-10% in our simulation studies.


  1. Abrams, Z., Goel, A., and Plotkin, S. (26-27 April 2004). Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. Information Processing in Sensor Networks, 2004. IPSN 2004. Third International Symposium on, pages 424-432.
  2. Akyildiz, I., Su, W., Sankarasubramaniam, Y., and Cayirci, E. (2002). A survey on sensor networks. IEEE Commun. Mag., pages 102-114.
  3. Berman, P., Calinescu, G., Shah, C., and Zelikovsky, A. (2004). Power efficient monitoring management in sensor networks. In Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE, volume 4, pages 2329-2334. IEEE.
  4. Cardei, M. and Du, D.-Z. (May 2005). Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 11:333-340(8).
  5. Cardei, M., Thai, M., Li, Y., and Wu, W. (2005). Energyefficient target coverage in wireless sensor networks. In IEEE Infocom, 2005.
  6. Cardei, M. and Wu, J. (2006). Energy-efficient coverage problems in wireless ad hoc sensor networks. Computer Communications, 29(4):413-420.
  7. Chong, C.-Y. and Kumar, S. (2003). Sensor networks: evolution, opportunities, and challenges. Proceedings of the IEEE, 91(8):1247-1256.
  8. Dhawan, A. and Prasad, S. K. (2009). A distributed algorithmic framework for coverage problems in wireless sensor networks. International Journal of Parallel, Emergent and Distributed Systems(IJPEDS).
  9. Gupta, G. and Younis, M. (2003). Fault-tolerant clustering of wireless sensor networks. IEEE Wireless Communications and Networking, 2003, pages 1579-1584.
  10. Iyengar, S. S. and Brooks, R. (2004a). Computing and communications in distributed sensor networks. Special Issue, Jr. of Parallel and Distributed Computing, 64(7).
  11. Iyengar, S. S. and Brooks, R. (2004b). Computing and communications in distributed sensor networks.
  12. Kuhn, F. (2006). Fault-tolerant clustering in ad hoc and sensor networks. In In 26th International Conference on Distributed Computing Systems (ICDCS.
  13. Kumar, S., Lai, T. H., and Balogh, J. (2004). On k-coverage in a mostly sleeping sensor network. In MobiCom 7804: Proceedings of the 10th annual international conference on Mobile computing and networking, pages 144-158, New York, NY, USA. ACM.
  14. Lenzen, C. and Wattenhofer, R. (2010). Minimum dominating set approximation in graphs of bounded arboricity. In Distributed Computing, volume 6343 of Lecture Notes in Computer Science, pages 510-524.
  15. Lu, J. and Suda, T. (20-21 Oct. 2003). Coverage-aware selfscheduling in sensor networks. Computer Communications, 2003. CCW 2003. Proceedings. 2003 IEEE 18th Annual Workshop on, pages 117-123.
  16. Pradhan, D. K., editor (1996). Fault-tolerant computer system design. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
  17. Prasad, S. K. and Dhawan, A. (2007). Distributed algorithms for lifetime of wireless sensor networks based on dependencies among cover sets. In HiPC 7807: Proceedings of the 14th International Conferenmce on High Performance Computing. Springer.
  18. Raj, R. and Ramesh, M. (2008). Fault tolerant clustering approaches in wireless sensor network for landslide area monitoring. In Proc. of the 2008 International Conference on Wireless Networks (ICWN'08), pages 107-113.
  19. Römer, K. and Mattern, F. (2004). The design space of wireless sensor networks. IEEE Wireless Communications, 11(6):54-61.
  20. Sahni, S. and Xu, X. (2004). Algorithms for wireless sensor networks. Intl. Jr. on Distr. Sensor Networks.
  21. Schmid, S. and Wattenhofer, R. (2006). Algorithmic models for sensor networks. In Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, pages 11 pp.-.
  22. Slijepcevic, S.; Potkonjak, M. (2001). Power efficient organization of wireless sensor networks. Communications, 2001. ICC 2001. IEEE International Conference on, 2:472-476 vol.2.

Paper Citation

in Harvard Style

Dhawan A. and Parks M. (2013). Fault-tolerant Coverage in Dense Wireless Sensor Networks . In Proceedings of the 2nd International Conference on Sensor Networks - Volume 1: SENSORNETS, ISBN 978-989-8565-45-7, pages 133-137. DOI: 10.5220/0004273501330137

in Bibtex Style

author={Akshaye Dhawan and Magdalena Parks},
title={Fault-tolerant Coverage in Dense Wireless Sensor Networks},
booktitle={Proceedings of the 2nd International Conference on Sensor Networks - Volume 1: SENSORNETS,},

in EndNote Style

JO - Proceedings of the 2nd International Conference on Sensor Networks - Volume 1: SENSORNETS,
TI - Fault-tolerant Coverage in Dense Wireless Sensor Networks
SN - 978-989-8565-45-7
AU - Dhawan A.
AU - Parks M.
PY - 2013
SP - 133
EP - 137
DO - 10.5220/0004273501330137