A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
The coverage problem in a wireless sensor network
Mobile Networks and Applications
A survey on wireless multimedia sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Wireless Networks
Joint Scheduling and Routing for Lifetime Elongation in Surveillance Sensor Networks
APSCC '07 Proceedings of the The 2nd IEEE Asia-Pacific Service Computing Conference
Maximizing Network Lifetime for Connected Target Coverage in Wireless Sensor Networks
WIMOB '06 Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Improving network lifetime using sensors with adjustable sensing ranges
International Journal of Sensor Networks
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Many sensor network applications require the tracking and the surveillance of target objects. We are specifically interested in the coverage problem known as perimeter coverage that the perimeter of the whole target has to be monitored while a single sensor can only monitor a certain portion of the perimeter. In this case, several sensors are required to ensure the perimeter coverage of the target, and our main focus is to monitor the whole target object as long as possible. In this paper, we first discuss the sufficient conditions in which a linear or a polynomial time optimal solution exists. Since no known polynomial time solution exists for configurations that do not satisfy the conditions, we study the dynamic duration technique to enhance the performance of existing heuristic mechanisms.