Abstract
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.
Original language | English |
---|---|
Title of host publication | MSWiM 2015 |
Subtitle of host publication | Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems |
Place of Publication | New York |
Publisher | Association for Computing Machinery |
Pages | 157-160 |
Number of pages | 4 |
ISBN (Electronic) | 9781450337625 |
DOIs | |
Publication status | Published - 2015 |
Event | ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - Cancun, Mexico Duration: 02 Nov 2015 → 06 Nov 2015 |
Conference
Conference | ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems |
---|---|
Period | 02/11/15 → 06/11/15 |