基于k-means分簇和灰狼优化的无线传感网络路由算法  

The wireless sensor networks routing algorithm based on k⁃means clustering and gray wolf optimization

作　　者：富立琪 王华倩 乔学工 FU Liqi;WANG Huaqian;QIAO Xuegong(School of Information and Computer,Taiyuan University of Technology,Jinzhong 030600,China;Changping Power Supply Company of Beijing Power,Beijing 102200,China)

机构地区：[1]太原理工大学信息与计算机学院,山西晋中030600 [2]国网北京昌平供电公司,北京102200

出　　处：《电子设计工程》2021年第23期1-6,共6页Electronic Design Engineering

基　　金：国家自然科学基金资助项目(51279122)。

摘　　要：针对无线传感网络(WSN)中簇首选择不合理、簇分布不均匀的问题,文中提出了一种基于k-means分簇和灰狼优化的无线传感网络路由算法。该算法将节点的位置和分布密度作为优化初始聚类所形成簇区域的考虑因素,根据节点平均剩余能量和邻居节点数等因素在优化后的簇区域内进行簇首选择,并采用改进灰狼优化算法选择簇首;数据通过簇内节点单跳和簇首间多跳的传输方式传输到汇聚节点。通过仿真实验将文中提出的算法与LEACH协议和KEAC协议进行比较,验证了该算法在延长网络生存时间上较LEACH协议和KEAC协议有明显的提高。Aiming at the problem of unreasonable cluster head selection and uneven cluster distribution in Wireless Sensor Networks(WSN),a wireless sensor network routing algorithm based on k-means clustering and gray wolf optimization is proposed.The algorithm takes the location and distribution density of nodes as considerations for optimizing the cluster area formed by the initial clustering,and then selects the cluster head in the optimized cluster area according to factors such as the average remaining energy of the node and the number of neighbor nodes,and adopts improved gray wolf optimization algorithm selects the cluster head;the data is transmitted to the sink node through single-hop and multi-hop transmission between cluster heads.Through simulation experiments,the algorithm proposed in this paper is compared with LEACH protocol and KEAC protocol,and it is verified that the algorithm is significantly improved compared with LEACH protocol and KEAC protocol in extending the network lifetime.

关 键 词：无线传感网络 k-means分簇 灰狼优化 路由 

分 类 号：TN929.5[电子电信—通信与信息系统]