基于改进最小生成树的三维路由算法  

Research on 3D routing algorithm based on improved minimum spanning tree

作　　者：崔颖[1] 李巧珏 高山[1] 陈立伟[1] CUI Ying;LI Qiaojue;GAO Shan;CHEN Liwei(College of Information and Communication Engineering,Harbin Engineering University,Harbin 150001,China)

机构地区：[1]哈尔滨工程大学信息与通信工程学院,黑龙江哈尔滨150001

出　　处：《应用科技》2023年第6期76-81,共6页Applied Science and Technology

基　　金：黑龙江省自然科学基金项目(LH2020F021).

摘　　要：针对三维无线传感器网络分簇后,簇内节点单跳至簇头时簇内节点能量消耗大的问题,提出了基于改进最小生成树(improved minimum spanning tree,IMST)的三维路由协议(three dimensional routing protocol,3DRT),IMST_3DRT引入K-means++算法均衡选举簇头,把能量和跳数加入最小生成树(minimum spanning tree,MST)的权重均衡簇内能耗,引入一种客观赋权法CRITIC(criteria importance though intercrieria correlation)计算权重系数,选出均衡下一跳。该算法与3D-LEACH、3D-mst2017、3D-KBECRA算法相比,能耗利用率分别提高了38.9%、22.1%、31.5%,寿命分别延长了30.6%、12.5%、7.0%。仿真结果表明,此算法能降低网络能耗、延长网络寿命。Aiming at the problem of large energy consumption of nodes in the cluster when they hop to the cluster head after clustering in 3D wireless sensor networks,a three-dimensional routing(3DRT)protocol based on improved minimum spanning tree(IMST)is proposed.IMST_3DRT introduces the K-means++algorithm to balance the election of cluster heads,adds energy and hops to the weight of minimum spanning tree(MST)to balance the energy consumption in the cluster,and introduces criteria importance though intercrieria correlation(CRITIC)algorithm to calculate the weight coefficient to select the next balanced hop.Compared with 3D-LEACH,3D-mst2017 and 3DKBECRA,the energy consumption utilization rate of this algorithm is increased by 38.9%,22.1%and 31.5%,and the service life is extended by 30.6%,12.5%and 7.0%.Simulation results show that this algorithm can reduce network energy consumption and prolong network life.

关 键 词：K-means++算法 最小生成树算法 路由协议 CRITIC算法 权重系数 网络能耗 簇头选举 能量均衡 

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