The Community for Technology Leaders
RSS Icon
Issue No.12 - December (2007 vol.56)
pp: 1681-1695
We develop an integer linear programming formulation to find a minimum cost deployment of sensors that provides the desired coverage of a target point set and propose a greedy heuristic for this problem. Our formulation permits heterogeneous multimodal sensors and is extended easily to account for nonuniform sensor detection resulting from blockages, noise, fading and so on. A greedy algorithm to solve the proposed general ILP is developed. Additionally ε-approximation algorithms and a polynomial time approximation scheme are proposed for the case of grid coverage. Experiments demonstrate the superiority of our proposed algorithms over earlier algorithms for point coverage of grids using heterogeneous sensors.
Wireless sensor networks, point coverage, multimodal sensors, approximation algorithm.
Xiaochun Xu, Sartaj Sahni, "Approximation Algorithms for Sensor Deployment", IEEE Transactions on Computers, vol.56, no. 12, pp. 1681-1695, December 2007, doi:10.1109/TC.2007.1063
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool