.png){kind=icon}
返回
Approximation algorithms for sensor deployment
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.1063.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
wireless sensor networks
point coverage
multimodal sensors
approximation algorithm
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
Stabilization of immiscible polymer blends using structure directing metal organic frameworks (MOFs).png)
Polymer
PolymerIF0
PREAI
分享收藏An incremental self-deployment algorithm for mobile sensor networks一种移动传感器网络增量式自部署算法AUTONOMOUS ROBOTS
AUTONOMOUS ROBOTSIF4.3
PREAI
分享收藏
查看更多内容