Efficient sensor network design for continuous monitoring of moving objects

DOI10.1016/j.tcs.2008.03.005zbMath1156.68619OpenAlexW2115335002MaRDI QIDQ936530

Paul G. Spirakis, Sotiris E. Nikoletseas

Publication date: 14 August 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.005

zbMATH Keywords

trackingapproximation algorithmsset coversensor networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (3)

Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks ⋮ Algorithmic Aspects of Sensor Localization ⋮ A sensor-based framework for kinetic data compression

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic construction of sets for k -restrictions
• A threshold of ln n for approximating set cover
• On the hardness of approximating minimization problems
• Grid coverage for surveillance and target location in distributed sensor networks
• Algorithmic Aspects of Wireless Sensor Networks

This page was built for publication: Efficient sensor network design for continuous monitoring of moving objects