.png){kind=icon}
返回
Regular Node Deployment for k-Coverage in m-Connected Wireless Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/JSEN.2015.2471837.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
k-coverage is an important issue in many applications of m-connected wireless networks, such as localization of objects, mobile robotics, and tourism industry, where k >= 1 and m >= 1. From the cost perspective, it is often very important to maintain the desired level of coverage and connectivity with a minimum number of nodes. In this paper, we address the problem of optimal deployment in term of the number of nodes required to achieve k-coverage in m-connected wireless networks under different values of k, m, coverage range, communication range, and area of the irregular field of interest (FoI). We divide the FoI into regular patterns and estimate the optimal distance between nodes and pattern for k-coverage in m-connected wireless networks. Next, we estimate the minimum number of nodes and their locations required for the coverage and connectivity. We validate the analysis and demonstrate the impact of k, m, coverage and communication ranges, and the FoI on the number of nodes using numerical, simulation, and prototype results.
Keyword:
Coverage
connectivity
localization
nodes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
2.2W
被引数:
7.3W
机构
暂无机构信息
引用论文
Optimal Deployment Patterns for Full Coverage and k-Connectivity (k ≤ 6) Wireless Sensor Networks
.png){kind=icon}
PREAI
分享收藏分享收藏Critical Sensor Density for Partial Coverage under Border Effects in Wireless Sensor Networks边界效应下无线传感器网络局部覆盖的临界传感器密度
PREAI
分享收藏
分享收藏
查看更多内容