.png){kind=icon}
Return
Approximation algorithms for sensor deployment
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.1063.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We develop an integer linear programming formulation to find the 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 for solving the proposed general ILP is developed. Additionally, epsilon-approximation algorithms and a polynomialtime 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 by using heterogeneous sensors.
Keywords:
wireless sensor networks
point coverage
multimodal sensors
approximation algorithm
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
No organization information available
Cited Papers
ShareSaveStabilization of immiscible polymer blends using structure directing metal organic frameworks (MOFs).png)
Polymer
PolymerIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more