Open Access Open Access  Restricted Access Subscription or Fee Access

Energy-Efficient PCP Protocol for Probabilistic k- Coverage in Sensor Networks

C.I. Vimalarani


Wireless sensor networks are networks for collecting environment information in specific area using sensor nodes with low power. The important research problems in such sensor network applications are ensuring area coverage and maintaining the connectivity of the network. Area coverage means that nodes use their sensing modules to detect events occurring in the monitored area. Each sensor is assumed to have a sensing range, which depends on the phenomenon being sensed and the environment conditions. Maintaining the sensor network connected is also important because information about the detected events may need to be communicated to processing centers for possible actions. Connectivity is achieved by the radio communication modules installed in the sensors. Each sensor is assumed to have a communication range, which is totally different from the sensing range in general. The power consumption of nodes determines the lifetime of the wireless sensor network. Thus, the design of low-power node is very important. The sensors sense physical phenomena in different ways, and thus, are expected to have different sensing models. Even for the same sensor type, the sensing model may need to be changed in different environments. Designing and testing a different coverage protocol for each sensing model is indeed a costly task. To address this challenging task, we propose a new probabilistic coverage protocol (PCP) that could employ different sensing models. We show that PCP works with the common disk sensing model as well as probabilistic sensing models, with minimal changes. In this paper, the analysis and design of our coverage protocol can be extended to the probabilistic K-coverage case. K-coverage is needed in several sensor network applications to enhance reliability and accuracy of the network.


Sensor Networks, Coverage in Sensor Networks, Probabilistic Coverage, Coverage Protocols

Full Text:



Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, no. 4, pp. 393-422, Mar. 2002.

G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks,” ACM Trans. Sensor Networks, vol. 1, no. 1, pp. 36-72, Aug. 2005.

Z. Zhou, S. Das, and H. Gupta, “Connected K-Coverage Problem in Sensor Networks,” Proc. Int’l Conf. Computer Comm. And Networks (ICCCN ’04), pp. 373-378, Oct. 2004.

H. Zhang and J. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Ad Hoc and Sensor Wireless Networks: An Int’l J., vol. 1, nos. 1/2, pp. 89-123, Jan. 2005.

S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable SensorGrids: Coverage, Connectivity, and Diameter,” Ad Hoc Networks, vol. 3, no. 6, pp. 702-716, Nov. 2005.

X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. Lai, “Deploying Wireless Sensors to Achieve Both Coverage and Connectivity,” Proc. ACM MobiHoc, pp. 131-142, May 2006.

Z. Abrams, A. Goel, and S. Plotkin, “Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks,” Proc.Int’l Symp. Information Processing in Sensor Networks (IPSN ’04),pp. 424-432, Apr. 2004.

D. Tian and N. Georganas, “Location and Calculation-Free Node Scheduling Schemes in Large Wireless Sensor Networks,” Elsevier Ad Hoc Networks, vol. 2, pp. 65-85, 2004.

T. Wu and K. Ssu, “Determining Active Sensor Nodes for Complete Coverage without Location Information,” Int’l J. Ad Hoc and Ubiquitous Computing, vol. 1, nos. 1/2, pp. 38-46, 2005.

S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava,“Coverage Problems in Wireless Ad-Hoc Sensor Networks,” Proc.IEEE INFOCOM, pp. 1380-1387, Apr. 2001.

D. Mehta, M. Lopez, and L. Lin, “Optimal Coverage Paths in Ad-Hoc Sensor Networks,” Proc. IEEE Int’l Conf. Comm. (ICC ’03), May 2003.

X. Li, P. Wan, and O. Frieder, “Coverage in Wireless Ad Hoc Sensor Networks,” IEEE Trans. Computers, vol. 52, no. 6, pp. 753-763, June 2003.

L. Lazos and R. Poovendran, “Stochastic Coverage in Heterogeneous Sensor Networks,” ACM Trans. Sensor Networks, vol. 2,no. 3, pp. 325-358, Aug. 2006.

C. Huang and Y. Tseng, “The Coverage Problem in a Wireless Sensor Network,” ACM Mobile Networks and Applications(MONET), special issue on wireless sensor networks, vol. 10,no. 4, pp. 519-528, Aug. 2005.

A. So and Y. Ye, “On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams,” Proc. Workshop Internet and Network Economics (WINE ’05), pp. 584-593, Dec. 2005.

K. Chakrabarty, S. Iyengar, H. Qi, and E. Cho, “Grid Coverage for Surveillance and Target Location in Distributed Sensor Net-works,” IEEE Trans. Computers, vol. 51, no. 12, pp. 1448-1453, Dec. 2002.

S. Yang, F. Dai, M. Cardei, J. Wu, and F. Patterson, “On Connected Multiple Point Coverage in Wireless Sensor Networks,” Int’l J. Wireless Information Networks, vol. 13, no. 4, pp. 289-301, May 2006.

F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Sets Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.

H. Gupta, Z. Zhou, S. Das, and Q. Gu, “Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execu-tion,” IEEE/ACM Trans. Networking, vol. 14, no. 1, pp. 55-67, Feb. 2006.

M. Hefeeda and M. Bagheri, “Randomized K-Coverage Algo-rithms for Dense Sensor Networks,” Proc. IEEE INFOCOM, 2376-2380, May 2007.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.