基于改进ABC的异构无线网络节能分簇路由算法  

Energy saving clustering routing algorithm for heterogeneous wireless networks based on improved ABC

作　　者：王丽[1,2] WANG Li(Qinghai Normal University,Xining 810000,China;Qinghai Vocational College of Police Officers,Xining 810000,China)

机构地区：[1]青海师范大学,青海西宁810000 [2]青海警官职业学院,青海西宁810000

出　　处：《电子设计工程》2025年第5期106-110,共5页Electronic Design Engineering

摘　　要：分簇路由易造成网络能量消耗高等问题,故提出基于改进ABC的异构无线网络节能分簇路由算法。在常规ABC算法的基础上加入轮盘赌反向选择机制,通过改变个体寻蜜行为强度,解决算法早期收敛问题;根据节点簇头与ID关系,设置网络节能分簇路由协议。计算每个节点处的等待时延,在确定簇头后,按照簇节点数量生成TDMA时隙,使每个节点均拥有传输权限。根据簇头节点的当前能量,给出归一化能量因子,结合更新的蜜源位置,获取最佳路由路径选择结果。实验表明,应用该算法后,第一个节点失效到最后一个节点失效的间隔更短,经过250轮次后,仍有35个节点存活,说明该算法延长了网络生命周期,能够达到节能目的。Cluster routing can easily cause high network energy consumption issues.Therefore,an energy-saving clustering routing algorithm based on improved ABC for heterogeneous wireless networks is proposed.On the basis of the conventional ABC algorithm,a roulette wheel reverse selection mechanism is added to solve the early convergence problem of the algorithm by changing the intensity of individual honey seeking behavior;Based on the relationship between node cluster heads and IDs,set up a network energy-saving clustering routing protocol.Calculate the waiting delay at each node,and after determining the cluster head,generate TDMA time slots based on the number of cluster nodes,so that each node has transmission permissions.Based on the current energy of the cluster head node,a normalized energy factor is given,combined with the updated honey source location,the optimal routing path selection result is obtained.Experiment shows that after applying this algorithm,the interval between the first node failure and the last node failure is shorter.After 250 rounds,35 nodes still survive,indicating that the algorithm extends the network lifecycle and can achieve energy-saving goals.

关 键 词：改进ABC 异构无线网络 节能分簇 路由路径 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]