.png){kind=icon}
返回
HORA: A Distributed Coverage Hole Repair Algorithm for Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2014.2359651.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In wireless sensor networks, random deployment of nodes may cause serious coverage overlapping among the nodes and the original network may suffer severe coverage problems due to death of the nodes after deployment. In this paper, efficient distributed coverage hole repair algorithms are proposed taking density of the nodes in the post deployment scenario. The proposed algorithms consider limited mobility of the nodes and can select the mobile nodes based on their degree of coverage overlapping. In order to repair coverage holes of the network, nodes with higher degree of density are moved to maintain uniform network density without increasing the coverage degree of the neighbors of a mobile node. Simulation results show that the energy consumption due to mobility of nodes is least as compared to other similar protocols of the Wireless Sensor Networks. Besides, it is observed that substantial amount of coverage overlapping can be minimized and percentage of coverage of the holes can be maximized.
Keyword:
Wireless sensor networks
density control
coverage
mobility
hole repair
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
