Efficient sensor network design for continuous monitoring of moving objects

Authors:
Sotiris Nikoletseas;Paul Spirakis
Affiliations:
Computer Technology Institute (CTI), Patras, Greece and Department of Computer Engineering & Informatics, University of Patras, Greece;Computer Technology Institute (CTI), Patras, Greece and Department of Computer Engineering & Informatics, University of Patras, Greece
Venue:
Theoretical Computer Science
Year:
2008

Citing 16
Cited 0

Approximation of k-set cover by semi-local optimization

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems

IEEE Transactions on Computers
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

IEEE Transactions on Computers
Approximating k-Set Cover and Complementary Graph Coloring

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Wireless Sensor Networks: An Information Processing Approach

Wireless Sensor Networks: An Information Processing Approach
Power conservation and quality of surveillance in target tracking sensor networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions

Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions
Using redundancy to cope with failures in a delay tolerant network

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithmic construction of sets for k-restrictions

ACM Transactions on Algorithms (TALG)
Distributed group management for track initiation and maintenance in target localization applications

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Efficient sensor network design for continuous monitoring of moving objects

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible number of sensors to be deployed, their positions and operation characteristics needed to perform the tracking task. To avoid an expensive massive deployment, we try to take advantage of possible coverage overlaps over space and time, by introducing a novel combinatorial model that captures such overlaps. Under this model, we abstract the tracking network design problem by a combinatorial problem of covering a universe of elements by at least three sets (to ensure that each point in the network area is covered at any time by at least three sensors, and thus being localized). We then design and analyze an efficient approximate method for sensor placement and operation, that with high probability and in polynomial expected time achieves a @Q(logn) approximation ratio to the optimal solution. Our network design solution can be combined with alternative collaborative processing methods, to suitably fit different tracking scenarios.