k-coverage Problems and Solutions in Wireless Sensor Networks: A Survey

Wireless Sensor Networks (WSNs) consist of sensor nodes those are capable of sensing environmental data such as temperature, humidity, pressure, sound etc. and transmit those data to a basestation through the network. Achieving sufficient coverage in the sensing area is a challenging feature in WSNs. Coverage indicates that how well an area is monitored i.e., whether each location of an area is within the sensing range of sensors. Some WSNs applications require multilevel coverage where each location in an area is covered by more than one sensor node. Moreover, sensor nodes must have to maintain a communication range among themselves. In this paper, a survey has been presented onk-coverage problems in WSNs where each location of an area should be covered by at least k sensors. Here, two categories of k-coverage problems have been identified and their different solution approaches have been discussed.

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

[2]  Arbee L. P. Chen,et al.  Verification of k-coverage on query line segments , 2013, IDEAS '13.

[3]  Yu-Chee Tseng,et al.  A Survey of Solutions for the Coverage Problems in Wireless Sensor Networks , 2005 .

[4]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[5]  Cheng Wang,et al.  Distributed k-Coverage Verification Algorithm Based on Localized Distance Information in WSNs , 2009, 2009 IEEE International Conference on Networking, Architecture, and Storage.

[6]  Yigal Bejerano,et al.  Simple and Efficient k-Coverage Verification without Location Information , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[7]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[8]  Robert Jan. Williams,et al.  The Geometrical Foundation of Natural Structure: A Source Book of Design , 1979 .

[9]  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).

[10]  Jang-Ping Sheu,et al.  Probabilistic Coverage Preserving Protocol with Energy Efficiency in Wireless Sensor Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[11]  Anthony Man-Cho So,et al.  On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams , 2005, WINE.

[12]  Sajal K. Das,et al.  Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks , 2012, IEEE Transactions on Computers.

[13]  A. Guttmma,et al.  R-trees: a dynamic index structure for spatial searching , 1984 .

[14]  Habib M. Ammari,et al.  On the Connected k-Coverage Problem in Heterogeneous Sensor Nets: The Curse of Randomness and Heterogeneity , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[15]  Bang Wang,et al.  Coverage problems in sensor networks: A survey , 2011, CSUR.

[16]  Ming Liu,et al.  A Survey of Coverage Problems in Wireless Sensor Networks , 2014 .

[17]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[18]  Yigal Bejerano,et al.  Coverage Verification without Location Information , 2012, IEEE Transactions on Mobile Computing.

[19]  Yu-Chee Tseng,et al.  The coverage problem in three-dimensional wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[20]  Jie Wu,et al.  On Connected Multiple Point Coverage in Wireless Sensor Networks , 2006, Int. J. Wirel. Inf. Networks.