>> 自然科学版期刊 >> 2015年01期 >> 正文
基于模糊K均值和自适应混合蛙跳算法的分簇路由设计
供稿: 刘珂;杨锋英 时间: 2018-11-19 次数:

作者:刘珂;杨锋英

作者单位:黄淮学院信息工程学院

摘要:为了解决传统分簇路由协议中存在的能耗开销不均衡和簇头选举不合理的问题,提出了一种基于模糊K均值和自适应混合蛙跳算法的WSN负载均衡分簇路由协议。首先,Sink节点收集各子区域的节点位置信息,并行运行模糊K均值算法将网络区域分为若干大小规模不同的簇,并将数据中心拟合到初始簇头节点。然后,以最大化节点剩余能量和最小化节点与簇头以及簇头与Sink节点的距离为目标定义了适应度函数,采用改进的自适应混合蛙跳算法对簇头进行寻优,并将最优解作为最终的簇头。最后,设计了最小跳数路由算法获得各簇头到Sink节点的最小跳数路由。采用NS2仿真工具对该方法进行仿真,实验表明:该方法具有较长的网络生命周期,较其它方法延长生命周期30%以上,具有较大的优越性。

基金:河南省科技攻关计划项目(122102310474);

关键词:模糊K均值;分簇路由;蛙跳算法;传感器;

DOI:10.16186/j.cnki.1673-9787.2015.01.015

分类号:TN929.5;TP212.9;TP18

Abstract:Aiming at the problem of uneven energy consumption for clustering routing and unreasonable cluster head selection,a clustering routing protocol based on fuzzy K-Means and adaptive shuffled frog algorithm was proposed.Firstly,a sink node is selected to collect the position information of sub-area and to operate fuzzy KMeans algorism for dividing all nodes to several clusters with different cluster size,and the data center was matched to the cluster head node.Then,the fitness function was defined by minimizing the node remain energy,the sum distance form the cluster inner node,and the distance from the sink node,and the improved adaptive shuffled frog algorithm was designed to optimize the cluster head.Finally,the least hop number algorithm was defined to obtain the route between the cluster head and the sink node.Using the NS2 simulation tool to emulate,the simulation experiment shows that the method has a longer network life circle,and that it improves the network life cycle for more than 30% compared with the other methods.Therefore,it has big superiority.

最近更新