.png){kind=icon}
返回
ε-Net Approach to Sensor k-Coverage
.png){kind=icon}
OA
AI
DOI：10.1155/2010/192752.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Wireless sensors rely on battery power, and in many applications it is difficult or prohibitive to replace them. Hence, in order to prolongate the system's lifetime, some sensors can be kept inactive while others perform all the tasks. In this paper, we study the k-coverage problem of activating the minimum number of sensors to ensure that every point in the area is covered by at least k sensors. This ensures higher fault tolerance, robustness, and improves many operations, among which position detection and intrusion detection. The k-coverage problem is trivially NP-complete, and hence we can only provide approximation algorithms. In this paper, we present an algorithm based on an extension of the classical epsilon-net technique. This method gives an O(logM)-approximation, where M is the number of sensors in an optimal solution. We do not make any particular assumption on the shape of the areas covered by each sensor, besides that they must be closed, connected, and without holes.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
1.9
论文数:
161
被引数:
3.6K
机构
引用论文
Genetic Characterization of DNA Region Containing the
trh
and
ure
Genes of
Vibrio parahaemolyticusOAAI
.png){kind=icon}
OAAI分享收藏分享收藏分享收藏Crystal structure refinement and reflectance measurements of hausmannite, Mn3O4hausmannite，Mn3O4的晶体结构细化和反射率测量
PREAI
分享收藏 没有更多内容
没有更多内容