吉林大学学报(理学版) ›› 2021, Vol. 59 ›› Issue (4): 950-955.

• • 上一篇    下一篇

基于混沌遗传算法的无线传感器网络改进LEACH算法

李蛟1, 胡黄水2, 赵宏伟3, 鲁晓帆2   

  1. 1. 吉林大学 图书馆, 长春 130012; 2. 吉林建筑科技学院 计算机科学与工程学院, 长春 130114; 3. 吉林大学 计算机科学与技术学院, 长春 130012
  • 收稿日期:2020-06-02 出版日期:2021-07-26 发布日期:2021-07-26
  • 通讯作者: 胡黄水 E-mail:526213804@qq.com

Improved LEACH Algorithm for Wireless Sensor Networks Based on Chaotic Genetic Algorithm

LI Jiao1, HU Huangshui2, ZHAO Hongwei3, LU Xiaofan2   

  1. 1. Library of Jilin University, Changchun 130012, China; 2. College of Computer Science and Engineering, Jilin University of Architecture and Technology, Changchun 130114, China; 3. College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2020-06-02 Online:2021-07-26 Published:2021-07-26

摘要: 针对传统LEACH协议及其改进方法能耗过高和负载不均衡的问题, 提出一种采用混沌遗传算法最小化无线传感器网络能量消耗的算法CGA-LEACH. 该算法通过构建新的考量能耗和负载的适应度函数, 采用条件约束的混沌映射生成实数编码染色体, 并用混沌遗传选择、 交叉和变异操作提高收敛速度, 找到最优簇头, 从而形成分布均匀、 能耗和负载均衡的簇结构. 仿真结果表明, CGA-LEACH算法能有效延长网络生命周期, 均衡网络负载, 提高网络能量效率.

关键词: 无线传感器网络, 混沌遗传算法, LEACH协议, 能耗最小

Abstract: Aiming at the problem of high energy consumption and unbalanced load in traditional LEACH protocol and its improved methods, we proposed an improved LEACH protocol based on chaotic genetic algorithm called CGA-LEACH to minimize the energy consumption for wireless sensor networks (WSNs). By constructing a new fitness function considering the energy consumption and load, the algorithm used conditional chaotic mapping to generate real coded chromosomes, and used the chaotic genetic selection, crossover and mutation operations to improve the convergence speed and find the optimal cluster heads, so as to form a cluster structure with uniform distribution, energy consumption and balanced load . Simulation results show that CGA-LEACH algorithm can effectively prolong network lifetime, balance network load and improve network energy efficiency.

Key words: wireless sensor networks (WSNs), chaotic genetic algorithm, LEACH protocol, minimum energy consumption

中图分类号: 

  • TP393