Abstract
Sensor networks are mainly used to gather strategic information in various monitored areas. Sensors may be deployed in zones where their internal memory, or the sensors themselves, can be corrupted. Since deployed sensors cannot be easily replaced, network persistence and robustness are the two main issues that have to be addressed while efficiently deploying large scale sensor networks. The goal of forming a Minimum Connected Cover of a query region in sensor networks is to select a subset of nodes that entirely covers a particular monitored area, which is strongly connected, and which does not contain a subset with the same properties.
In this paper, we consider the general case, wherein every sensor has a different sensing and communication radius. We propose two novel and robust solutions to the minimum connected cover problem that can cope with both transient faults (corruptions of the internal memory of sensors) and sensor crash/join. Also, our proposal includes extended versions which use multi-hop information. Our algorithms use small atomicity (i.e., each sensor reads variables of only one of its neighbors at a time). Our solutions are self ∗ (self-configuration, self-stabilization, and self-healing). Via simulations, we conclude that our solutions provide better performance, in terms of coverage, than pre-existing self-stabilizing solutions. Moreover, we observe that multi-hop solutions produce a better approximation to an optimal cover set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cerpa, A., Estrin, D.: Ascent: Adaptive self-configuring sensor networks topologies. In: INFOCOM 2002. Proceedings of the Conference on Computer Communications (June 2002)
Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In: MobiCom 2002. Proceedings of the Seventh Annual Inernational Conference on Mobile Computing and Networking, pp. 85–96 (July 2001)
Dai, F., Wu, J.: Distributed dominant pruning in ad hoc networks. In:Proceedings of ICC 2003 (2003)
Datta, A.K., Gradinariu, M., Patel, R.: Distributed self-∗ minimum connected covering of a query region in sensor networks. In: ISPAN 2005, pp. 448–453 (2005)
Datta, A.K., Linga, P., Gradinariu, M., Raipin-Parvedy, P.: Self-* distributed query region covering in sensor networks. In: SRDS 2005. 24th IEEE Symposium on Reliable Distributed Systems, pp. 50–59 (October 2005)
Datta, A.K., Potop-Butucaru, M.G., Patel, R., Yamazaki, A.: Self* minimum connected covers of sensing regions in sensor networks. Technical report, INRIA, France (2007)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Drabkin, V., Friedman, R., Gradinariu, M.: Self-stabilizing wireless connected overlays. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 425–439. Springer, Heidelberg (2006)
Gupta, H., Das, S.R., Gu, Q.: Connected sensor cover: Self-organization of sensor networks for efficient query execution. In: MobiHoc 2003. Proceedings of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 189–200 (2003)
Jiang, Z., Kline, R., Wu, J., Dai, F.: A practical method to form energy efficient connected -coverage in wireless sensor networks. In: ICDCS Workshops, p. 81 (2006)
Shakkottai, S., Srikant, R., Shroff, N.: Unreliable sensor grids: Coverage, connectivity and diameter. In: INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 1073–1083 (April 2003)
Tian, D., Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: WSNA 2002. Proceedings of the First Workshop on Sensor Networks and Applications, pp. 32–41 (September 2002)
Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: ACM SenSys 2003. Proceedings of the First International Conference on Embedded Networked Sensor Systems, pp. 28–39 (November 2003)
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: MobiCom 2002. Proceedings of the Seventh Annual Inernational Conference on Mobile Computing and Networking, pp. 70–84 (2001)
Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: PEAS: A robust energy conserving protocol for long-lived sensor networks. In: ICDCS 2003. Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 1–10 (2003)
Zhang, H., Arora, A.: GS3: Scalable self-configuring and self-healing in wireless networks. In: PODC 2002. Proceedings of the Twentyfirst Annual ACM Symposium on Principles of Distributed Computing (2002)
Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Technical Report UIUCDCS-R-2003-2351, University of Illinois at Urbana Champaign, (June 2003)
Zhou, Z., Das, S.R., Gupta, H.: Connected k-coverage problem in sensor networks. In: ICCCN, pp. 373–378 (2004)
Zhou, Z., Das, S.R., Gupta, H.: Fault tolerant connected sensor cover with variable sensing and transmission ranges. In: SECON (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A.K., Gradinariu Potop-Butucaru, M., Patel, R., Yamazaki, A. (2007). Self* Minimum Connected Covers of Query Regions in Sensor Networks. In: Masuzawa, T., Tixeuil, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2007. Lecture Notes in Computer Science, vol 4838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76627-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-76627-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76626-1
Online ISBN: 978-3-540-76627-8
eBook Packages: Computer ScienceComputer Science (R0)