Analysis of k-Coverage in Wireless Sensor Networks

Recently, a concept of wireless sensor networks has attracted much attention due to its wide-range of potential applications. Wireless sensor networks also pose a number of challenging optimization problems. One of the fundamental problems in sensor networks is the coverage problem, which reflects the quality of service that can be provided by a particular sensor network. The coverage concept is depending from several points of view due to a variety of sensors and a wide-range of their applications. One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine the degree of coverage of a sensor network, which is covered by at least k sensors, where k is a predefined value. The sensing ranges of sensors can be same or different. Performance evaluation of our protocol indicates that degree of coverage of wireless sensor networks can be determined within small period of time. Therefore energy consumption of the sensor networks can be minimized.

@article{Patra2011,
  title     = {Analysis of k-Coverage in Wireless Sensor Networks},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {2},
  number    = {9},
  year      = {2011},
  publisher = {The Science and Information Organization},
  author    = {Rasmi Ranjan Patra and Prashanta Kumar Patra},
  doi       = {10.14569/IJACSA.2011.020915},
  url       = {https://doi.org/10.14569/IJACSA.2011.020915}
}