摘要
分簇路由协议的提出有效地延长了网络的生存时间,提升了网络性能。本文基于对现有路由算法的研究,提出基于竞争机制的簇头选举算法。该算法综合考虑了节点的能量因子,消除簇头选举位置不均和节点能量消耗失衡的情况。仿真结果表明,该算法改进了LEACH算法中随机选取簇头所导致能量损耗和位置分布不均衡的不足,有效地延长了网络的生存时间。
The clustering routing protocols can effectively prolong the lifetime of the network and improve the performance of the network. Based on the research on LEACH algorithm, this paper proposes a cluster head election algorithm based on competition mechanism, which comprehensively considers the energy factor of the node, and eliminates the imbalance between cluster head election position and node energy consumption. Simulation results show that the proposed algorithm improves the energy loss and the position distribution of the cluster heads in the LEACH algorithm, and effectively prolongs the lifetime of the network.
作者
雷宇飞
LEI Yufei(Quanzhou Institute of Information Engineering, Quanzhou, Fujian, 362000, Chin)
出处
《宁波工程学院学报》
2018年第1期50-57,共8页
Journal of Ningbo University of Technology
基金
泉州市高等学校中青年学科带头人培养计划(泉教高[2018]1号)
关键词
能耗均衡
阈值
LEACH-M
生存时间
Energy balance, threshold, LEACH-M routing algorithm, survival time