Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Graph Theory With Applications
Graph Theory With Applications
Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
| Hi-index | 0.00 |
Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them at selected sites. We want to find a sensor arrangement to achieve the required coverage lifetime such that the total (monetary) cost of the chosen sensors is minimum. This is an NP-hard problem. We approach this problem by modelling it as an Integer Linear Programming problem. We devise a polynomial-time approximation algorithm to this problem with a proven approximation guarantee. We observe that the actual approximation ratios are small in practice. We then present a time-slotted scheduling to produce a timetable for each sensor. We also consider a special case with only one type of sensor that can watch one target at a time. We present a different method for solving this problem.