• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Renewable Energy and Environmental Technology >An Efficient Coverage Hole Patching Algorithm Based On Intersection Knowledge
【24h】

An Efficient Coverage Hole Patching Algorithm Based On Intersection Knowledge

机译：基于交叉识别知识的高效覆盖孔修补算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Aiming at the phenomenon of coverage holes because of energy depletion and random nodes deployment in wireless sensor networks (WSN), a principle for hole coverage was proposed. Based on the triangular geometry knowledge, firstly, determined the optimal patching station in basis of the benchmark-intersection, and then active inactive nodes to patch the hole. The simulation experiments demonstrate that this algorithm makes full of energy resources in the premise of complete coverage to patch coverage hole, and has a better performance in the number of the mobile nodes, resource utilization rate and algorithm running time efficiency compared with the existing DACHP and PATT algorithm.
机译：针对无线传感器网络（WSN）中的能量耗尽和随机节点部署，占据覆盖孔的现象，提出了孔覆盖的原理。基于三角形几何知识，首先，基于基准 - 交叉点确定最佳修补站，然后在主动非活动节点上进行连接到修补孔。仿真实验表明，该算法在完全覆盖到补丁覆盖孔的前提下充满了能量资源，并且与现有的TACHP相比，在移动节点，资源利用率和算法运行时间效率的数量中具有更好的性能Patt算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号