.png){kind=icon}
返回
Surface Coverage in Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2013.35.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Coverage is a fundamental problem in wireless sensor networks (WSNs). Conventional studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. The 3D surface of a field of interest (FoI) is complex in many real-world applications. However, existing coverage studies do not produce practical results. In this paper, we propose a new coverage model called surface coverage. In surface coverage, the field of interest is a complex surface in 3D space and sensors can be deployed only on the surface. We show that existing 2D plane coverage is merely a special case of surface coverage. Simulations point out that existing sensor deployment schemes for a 2D plane cannot be directly applied to surface coverage cases. Thus, we target two problems assuming cases of surface coverage to be true. One, under stochastic deployment, what is the expected coverage ratio when a number of sensors are adopted? Two, if sensor deployment can be planned, what is the optimal deployment strategy with guaranteed full coverage with the least number of sensors? We show that the latter problem is NP-complete and propose three approximation algorithms. We further prove that these algorithms have a provable approximation ratio. We also conduct extensive simulations to evaluate the performance of the proposed algorithms.
Keyword:
Wireless sensor networks
surface coverage
expected coverage ratio
optimal coverage strategy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容