CWSC: Connected k-coverage working sets construction algorithm in wireless sensor networks

Abstract One of the most important issues for wireless sensor networks is to get a long network lifetime without affecting either communication connectivity or sensing coverage. Many sensors that are deployed randomly in a dense sensor network in a redundant way waste a lot of energy. One effective way to save energy is to let only a subset of sensors work at any given time. In this paper, we mainly consider such a problem. Selecting the minimum number of connected sensor nodes that can provide k -coverage ( k  ≥ 1), i.e., selecting a subset S of working sensors, such that almost every point in the sensing region can be covered by at least k sensors and the sensors in S can form a connected communication subgraph. We propose a connected k -coverage working sets construction algorithm (CWSC) based on Euclidean distance to k -cover the sensing region while minimizing the number of working sensors. CWSC can produce different coverage degrees according to different applications, which can enhance the flexibility of the sensor network. Simulation results show that the proposed algorithm, which can conserve energy and prolong the lifetime of the sensor network, is better than the previous algorithms.

[1]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[2]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[3]  Jun Lu,et al.  Coverage-aware self-scheduling in sensor networks , 2003, 2002 14th International Conference on Ion Implantation Technology Proceedings (IEEE Cat. No.02EX505).

[4]  Mohammad S. Obaidat,et al.  Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks , 2011, Comput. Commun..

[5]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[6]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[7]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[8]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[9]  Krishna M. Sivalingam,et al.  Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications , 2002 .

[10]  David K. Y. Yau,et al.  Matching and Fairness in Threat-Based Mobile Sensor Coverage , 2009, IEEE Transactions on Mobile Computing.

[11]  Kasim Sinan YILDIRIM,et al.  Optimizing Coverage in a K-Covered and Connected Sensor Network Using Genetic Algorithms , 2008 .

[12]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[13]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[14]  Pramod K. Varshney,et al.  Distributed Detection and Data Fusion , 1996 .

[15]  Yu-Chee Tseng,et al.  Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network , 2007, TOSN.

[16]  L. Liu,et al.  Energy conservation algorithms for maintaining coverage and connectivity in wireless sensor networks , 2010, IET Commun..

[17]  Xiang Ji,et al.  Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling , 2004, IEEE INFOCOM 2004.

[18]  Weijia Jia,et al.  Optimal Deployment Patterns for Full Coverage and $k$-Connectivity $(k \leq 6)$ Wireless Sensor Networks , 2010, IEEE/ACM Transactions on Networking.

[19]  Li-Hsing Yen,et al.  Expected k-coverage in wireless sensor networks , 2006, Ad Hoc Networks.