Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
IEEE Transactions on Computers
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Stochastic coverage in heterogeneous sensor networks
ACM Transactions on Sensor Networks (TOSN)
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
IEEE Transactions on Parallel and Distributed Systems
Clustering-based minimum energy wireless m-connected k-covered sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
| Hi-index | 0.00 |
Sensor scheduling is a critical issue in the design of wireless sensor networks (WSNs) with a goal to achieve certain coverage degree of a field. In this paper, we focus on the sensor scheduling problem to guarantee sensing k-coverage , where each point in a field is covered by at least k sensors, while maintaining network connectivity . Precisely, we propose a global framework that considers both deterministic and stochastic sensing models of the sensors. For each of these sensing models, we decompose the sensor scheduling problem for k -coverage in WSNs into two sub-problems: k -coverage characterization problem and k-coverage-preserving scheduling problem . Our solution to the first problem is based on Helly's Theorem and the analysis of a geometric structure, called Reuleaux triangle . To solve the second problem, we propose a distributed approach that enables each sensor to run a k-coverage candidacy algorithm to check whether it is eligible to turn itself on . We find a perfect match between our simulation and analytical results.