Introduction to algorithms
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On deriving the upper bound of α-lifetime for large sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Approximate Coverage in Wireless Sensor Networks
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Maximizing network lifetime in energy-constrained wireless sensor network
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Percentage coverage configuration in wireless sensor networks
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Sensor density for complete information coverage in wireless sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Sensor scheduling for p-percent coverage in wireless sensor networks
Cluster Computing
| Hi-index | 0.00 |
Due to resource constraint of WSNs, it may be unnecessary or impossible to provide full coverage in many applications. Instead, partial coverage is enough to satisfy user requirements. Meanwhile, by applying partial coverage, network lifetime can be prolonged remarkably which is a primary goal of WSNs. In this paper, we investigate the p-Percent Coverage Problemwhich only requires that p% of the whole area to be monitored at any time and the Connected p-Percent Coverage Problemwhich enforces connectivity in addition. We propose two algorithms. One is pPCAwhich is a greedy algorithm to solve the p-Percent Coverage Problem. The other is CpPCA-CDS, which is a total distributed algorithm based on Connected Dominating Set to address Connected p-Percent Coverage Problem. The Sensing Void Distance after using CpPCA-CDScan be bounded by a constant. Theoretical analysis as well as simulation results are provided to evaluate our algorithms.