文章摘要
引用本文:
一种LEACH无线传感网路由协议的优化
Optimization of routing protocol for LEACH wireless sensor network
投稿时间:2017-02-15  修订日期:2017-06-21
DOI:
中文关键词: LEACH  路由协议  簇头选择
英文关键词: LEACH, Routing Protocol, Cluster Head Election
基金项目:福建省科技计划项目2014H0026
作者单位E-mail
黄继伟 福州大学物理与信息工程学院 huangjw@fzu.edu.cn 
摘要点击次数: 92
全文下载次数: 6
中文摘要:
      经典分簇路由协议LEACH存在簇首随机选举以及簇头过于密集等问题,本文提出的LEACH-P算法对这些问题进行优化。优化后的算法不仅把节点剩余能量作为簇头选举的考量标准,而且节点在晋升为簇头时还对簇头之间的距离进行约束,这样不至于造成簇头节点过于密集,除此之外,接近sink的普通节点直接把数据传输到sink节点。通过仿真结果可以看出,优化后算法的网络生命有很明显的提高,数据传输能力也得到很好的改善。
英文摘要:
      The classical clustering routing protocol LEACH has many problems, such as cluster head random election and cluster head being too dense, so the LEACH-P algorithm proposed in this paper can optimize these issues. The improved algorithm take the residual energy of node as the cluster head election standards, and when a node is promoted to a cluster head, the distance between the cluster heads is constrained, so as not to cause the cluster head node is too dense, in addition, ordinary nodes close to the sink directly to transmit data to sink node. It can be seen from the simulation results that the life of the optimized algorithm is obviously improved, and the ability of data transmission is improved.
View Fulltext   查看/发表评论  下载PDF阅读器
关闭