Abstract
In this paper, we consider the connected coverage problem and aim to construct a minimal connected cover set that is sufficient for a given query in wireless sensor networks. We propose a centralized, Voronoi tessellation (CVT) based algorithm to select the minimum number of active sensor nodes needed to cover the target region completely. The constructed sensor set proves to be connected when sensor node’s communication range is at least twice of its sensing range. For other situations where the CVT algorithm alone cannot guarantee the network connectivity, we design a Steiner minimum tree (SMT) based algorithm to ensure the network connectivity. Theoretical analysis and simulation results show that our algorithm outperforms the greedy algorithm in terms of both the time complexity and the needed number of sensor nodes that must be kept active to respond to a given query.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Computer Networks, vol. 38(4). Elsevier, Amsterdam (2002)
Elson, J., Estrin, D.: Wireless Sensor Networks, pp. 3–20. Kluwer, Dordrecht (2004)
Slijepcevic, S., Potkonjak, M.: Power Efficient Organization of Wireless Sensor Networks. In: Proc. of IEEE ICC 2001, Helsinki, Finland (2001)
Ye, F., Zhong, G., Lu, S., Zhang, L.: Peas: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks. In: Proc. of ICDCS (2003)
Tian, D., Georganas, N.D.: A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: Proc. of WSNA 2002, Atlanta, Georgia, USA (2002)
Chen, H., Wu, H., Tzeng, N.: Grid-Based Approach for Working Node Selection in Wireless Sensor Networks. In: Proc. of IEEE International Conference on Communications (ICC), Paris, France (2004)
Carbunar, B., Grama, A., Vitek, J., Carbunar, O.: Proceedings of the 1st IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), pp. 377–386 (2004)
Yan, T., He, T., Stankovic, J.: Differentiated Surveillance Service for Sensor Networks. In: Proc. of SenSys 2003, Los Angels, CA, USA (2003)
Gupta, H., Das, S.R., Gu, Q.: Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution. In: Proc. of MobiHoc 2003, Annapolis, Maryland, USA (2003)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagram. John Wiley & Sons, New York (1999)
Hochbaum, D.S.: Approximation Algorithms for Np-Hard Problems. PWS Publishing Company (1995)
Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. In: Proceedings of NSF International Workshop on Theoretical and Algorihtmic Aspects of Sensors, Ad Hoc Wireless, and Peer-to-Peer Networks (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, J., Song, Z., Zhang, H., Dou, W. (2005). Voronoi-Based Improved Algorithm for Connected Coverage Problem in Wireless Sensor Networks. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds) Embedded and Ubiquitous Computing – EUC 2005. EUC 2005. Lecture Notes in Computer Science, vol 3824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596356_25
Download citation
DOI: https://doi.org/10.1007/11596356_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30807-2
Online ISBN: 978-3-540-32295-5
eBook Packages: Computer ScienceComputer Science (R0)