The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Coverage Issue in Sensor Networks with Adjustable Ranges
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
| Hi-index | 0.00 |
Sensor networks have a wide range of potential and practical application. A sensor network consists of a large number of tiny, low power and short-living sensors. Some sensor network applications require k- coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this dissertation, an algorithm proposed which groups sensors in to disjoint subsets. Every subset cans k-cover the whole area. The subsets are scheduled to work successively. Therefore, the network lifetime is prolonged. Furthermore, sensing range is fixed. Also another algorithm, proposed which constructs some nondisjoint subsets, and in each active subset, each sensor only works with its smallest possible sensing range. Simulation results are presented to evaluate our proposed algorithms.