PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A Distributed Active Sensor Selection Scheme for Wireless Sensor Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
On coverage problems of directional sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Coverage-Aware sensor engagement in dense sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Prolonging Network Lifetime for Target Coverage in Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Adaptive scheduling of wireless video sensor nodes for surveillance applications
Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Journal of Network and Computer Applications
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Coverage and activity management of wireless video sensor networks for surveillance applications
International Journal of Sensor Networks
Hi-index | 0.00 |
Recently directional sensors have been widely deployed as they are more practicable under constraints of manufacture, size and cost. One common functionality of networks formed by such directional sensors is to monitor a set of discrete targets continuously. Large scale deployment makes sensor recharge impossible. By abundant deployment, it is reasonable and necessary to select subsets of sensors to operate alternatively so as to prolong the network lifetime. Such problem has been proved to be NP-Complete. This paper approximates network lifetime problem by randomized algorithm. Through constructing elementary sessions, which denotes active subset of sensors covering all targets, and linear programming, the approximating solution is derived within extremely less duration comparing to previous works. Simulation results demonstrate the algorithm's performance and sound explanation is also presented.