Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint
IEEE Transactions on Mobile Computing
Distributed energy-efficient scheduling approach for k-coverage in wireless sensor networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Energy-Efficient connected coverage of discrete targets in wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
This paper presents an energy-efficient distributed target coverage algorithm(EDTC) for heterogeneous wireless sensor networks(HWSN) with multiple sensing units. In order to utilize the energy more efficiently, the sensor priority is introduced in this paper to integrate the sensing ability and the remaining energy together. EDTC is locally and simultaneously carried out at each sensor in a rounding fashion. Each sensor decides the on/off status of its sensing units at the beginning of each round, and then broadcasts the decision to its one-hop neighbors. The higher the priority of a sensor is, the shorter the decision time it needs. Simulation results show that compared with Energy First(EF) scheme and Integer Linear Programming(ILP) solution, EDTC has longer network lifetime than EF, and the performance difference between EDTC and ILP solution is confined within 10%.