Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
IEEE Communications Magazine
Survivable and delay-guaranteed backbone wireless mesh network design
Journal of Parallel and Distributed Computing
Pareto-based evolutionary computational approach for wireless sensor placement
Engineering Applications of Artificial Intelligence
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete
Computer Networks: The International Journal of Computer and Telecommunications Networking
Communication restoration within wireless sensor networks
Proceedings of the 10th International Conference on Advances in Mobile Computing & Multimedia
| Hi-index | 0.00 |
In this paper, we develop an algorithm to deploy an energy efficient sensor network such that it provides surveillance and target-positioning services. We consider to place K independent sets of sensors on a sensor field. These sets monitor the field in turn and work together when intrusion events occur. The life-time of the sensor network is therefore prolonged up to K times. The problem is therefore a variant of the set K-cover problem, which is NP-complete. We formulate such sensor deployment problem as a 0/1 integer programming problem. A Simulated Annealing based heuristic then is proposed for solving the optimization problem. The experimental results show that the proposed algorithm indicates a significant improvement in the sensor lifetime compared to the intuitive approach. Furthermore, the proposed algorithm is highly effective and efficient in terms of the overall deployment cost.