Abstract

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 on k-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.

References

• H. M. Ammari and S. K. Das. Centralized and clustered kcoverage protocols for wireless sensor networks. Computers, IEEE Transactions on, 61(1):118–133, Jan 2012.
• H. M. Ammari and J. Giudici. On the connected k-coverage problem in heterogeneous sensor nets: The curse of randomness and heterogeneity. In Distributed Computing Systems, 2009. ICDCS '09. 29th IEEE International Conference on, pages 265–272, June 2009.
• Yigal Bejerano. Simple and efficient k-coverage verification without location information. In INFOCOM 2008. The 27th Conference on Computer Communications. IEEE. IEEE, 2008.
• Yigal Bejerano. Coverage verification without location information. Mobile Computing, IEEE Transactions on, 11(4):631–643, 2012.
• Antonin Guttman. R-trees: A dynamic index structure for spatial searching, volume 14. ACM, 1984.
• Chi-Fu Huang and Yu-Chee Tseng. The coverage problem in a wireless sensor network. Mob. Netw. Appl. , 10(4):519–528, August 2005.
• Chi-Fu Huang and Yu-Chee Tseng. A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology, 6(1):1–8, 2005.
• Chi-Fu Huang, Yu-Chee Tseng, and Li-Chu Lo. The coverage problem in three-dimensional wireless sensor networks. Journal of Interconnection Networks, 8(03):209–227, 2007.
• Kun-Han Juang, En Tzu Wang, Chieh-Feng Chiang, and Arbee LP Chen. Verification of k-coverage on query line segments. In Proceedings of the 17th International Database Engineering & Applications Symposium, pages 114–121. ACM, 2013.
• Junbin LIANG, LIU Ming, and KUI Xiaoyan. A survey of coverage problems in wireless sensor networks. Sensors & Transducers (1726-5479), 163(1), 2014.
• Joseph O'rourke. Art gallery theorems and algorithms, volume 1092. Oxford University Press Oxford, 1987.
• Jang-Ping Sheu and Huang-Fu Lin. Probabilistic coverage preserving protocol with energy efficiency in wireless sensor networks. In Wireless Communications and Networking Conference, 2007. WCNC 2007. IEEE, pages 2631–2636, March 2007.
• Anthony Man-Cho So and Yinyu Ye. On solving coverage problems in a wireless sensor network using voronoi diagrams. In Internet and Network Economics, pages 584–593. Springer, 2005.
• Bang Wang. Coverage problems in sensor networks: A survey. ACM Computing Surveys (CSUR), 43(4):32, 2011.
• Xiaorui Wang, Guoliang Xing, Yuanfang Zhang, Chenyang Lu, Robert Pless, and Christopher Gill. Integrated coverageand connectivity configuration in wireless sensor networks. In Proceedings of the 1st international conference on Embedded networked sensor systems, pages 28–39. ACM, 2003.
• Robert Williams. The geometrical foundation of natural structure. Dover Publications, 1979.
• Shuhui Yang, Fei Dai, Mihaela Cardei, JieWu, and Floyd Patterson. On connected multiple point coverage in wireless sensor networks. International Journal of Wireless Information Networks, 13(4):289–301, 2006.
• Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, and Floyd Patterson. On connected multiple point coverage in wireless sensor networks. Journal of Wireless Information Networks, 2006, 2006.
• Xia Zhang and Cheng Wang. Distributed k-coverage verification algorithm based on localized distance information in wsns. In Networking, Architecture, and Storage, 2009. NAS 2009. IEEE International Conference on, pages 196–199. IEEE, 2009.
• Zongheng Zhou, Samir Das, and Himanshu Gupta. Connected k-coverage problem in sensor networks. In Computer Communications and Networks, 2004. ICCCN 2004. Proceedings. 13th International Conference on, pages 373–378. IEEE, 2004.