.png){kind=icon}
.png){kind=icon}
返回
Study on Connected Target Coverage Algorithm for Wireless Sensor Network
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2880729.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Aiming at the serious effect of coverage hole caused by the poor deployment environment and the limited energy of wireless sensor network (WSN) on network lifetime, an optimized and lightweight energy-efficient connected coverage heuristic (OECCH) algorithm is proposed. Armed with the analysis of the coverage contribution, the sensor nodes are categorized into sensing nodes and relay nodes. Then, an intersection connected cover set is constructed based on the heuristic values, and the network lifetime is maximized in combination with energy update and coverage recovery. Simulation results indicate that OECCH can prolong the network lifetime while reducing the computation overhead of WSN obviously.
Keyword:
Connected target coverage
coverage/connectivity heuristic
network lifetime
wireless sensor network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。