Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A distributed monitoring mechanism for wireless sensor networks
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
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
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient surveillance system using wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Connected K-target coverage problem in wireless sensor networks with different observation scenarios
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fundamental results on target coverage problem in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Theoretical treatment of target coverage in wireless sensor networks
Journal of Computer Science and Technology - Special issue on natural language processing
Distributed media-aware flow scheduling in cloud computing environment
Computer Communications
| Hi-index | 0.00 |
This paper addresses the maximal lifetime scheduling for k to 1 sensor-target surveillance networks. Given a set of sensors and targets in Euclidean plane, a sensor can watch only one target at a time and a target should be watched by k sensors (k ≥ 2) at anytime. Our task is to schedule sensors to watch targets, such that the lifetime of the surveillance system is maximized, where the lifetime is the duration that all targets are watched. We propose an optimal solution to find the target watching schedule for sensors that achieves the maximal lifetime. This is the first time in the literature that this scheduling problem of sensor surveillance systems has been formulated and the optimal solution has been found. Our solution consists of three steps: (1) computing the maximal lifetime of the surveillance system and a workload matrix by using linear programming techniques; (2) decomposing the workload matrix into a sequence of schedule matrices by extending the Hall's theory, to achieve the maximal lifetime; (3) obtaining a target watching timetable for each sensor based on the schedule matrices. The time complexity of our optimal method is O(m2n3), where m, n are the number of targets and the number of sensors, respectively. We illustrate our optimal method by a numeric example and experiments in the end.