.png){kind=icon}
返回
Maximum Target Coverage Problem in Mobile Wireless Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.3390/s21010184.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility. Given a set of targets to be covered and a set of mobile sensors, we seek a sensor dispatch algorithm maximizing the covered targets under the constraint that the maximal moving distance for each sensor is upper-bounded by a given threshold. We prove that the problem is NP-hard. Given its hardness, we devise four algorithms to solve it heuristically or approximately. Among the approximate algorithms, we first develop randomized (1-1/e)-optimal algorithm. We then employ a derandomization technique to devise a deterministic (1-1/e)-approximation algorithm. We also design a deterministic approximation algorithm with nearly Delta(-1) approximation ratio by using a colouring technique, where denotes the maximal number of subsets covering the same target. Experiments are also conducted to validate the effectiveness of the algorithms in a variety of parameter settings.
Keyword:
approximation algorithm
integer programming
mobile sensors
target coverage
wireless sensor network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Maximizing the wireless sensor networks lifetime through energy efficient connected coverage.png)
AD HOC NETWORKS
AD HOC NETWORKSIF4.8
PREAI
分享收藏Long-term risk of relapse in immune-mediated thrombotic thrombocytopenic purpura and the role of anti-CD20 therapyBlood
OAAI
BloodIF0
OAAI分享收藏分享收藏
查看更多内容