Connected P-Percent Coverage in Wireless Sensor Networks based on Degree Constraint Dominating Set Approach
Habib Mostafaei, Morshed Chowdhury, Rafiqul Islam, Hojjat Gholizadeh · 2015
In this paper, we propose an algorithm for connected p-percent coverage problem in Wireless Sensor Networks(WSNs) to improve the overall network life time. In this work, we investigate the p-percent coverage problem(PCP) in WSNs which requires p% of an area should be monitored correctly and to find out any additional requirements of the connected p-percent coverage problem. We propose pDCDS algorithm which is a learning automaton based algorithm for PCP. pDCDS is a Degree-constrained Connected Dominating Set based algorithm which detect the minimum number of nodes to monitor an area. The simulation results demonstrate that pDCDS can remarkably improve the network lifetime.