一种新型的无线传感器网络能效路由算法  

Novel energy-efficient routing algorithm in wireless sensor network

作　　者：曾伟健 梁家荣[1,2] Zeng Weijian;Liang Jiarong(School of Computer,Electronic&Information,Guangxi University,Nanning 530004,China;Guangxi Key Laboratory of Multimedia Communications&Network Technology,Nanning 530004,China)

机构地区：[1]广西大学计算机与电子信息学院,南宁530004 [2]广西多媒体通信与网络技术重点实验室,南宁530004

出　　处：《计算机应用研究》2023年第8期2461-2466,共6页Application Research of Computers

基　　金：国家自然科学基金资助项目(61862003);广西自然科学基金资助项目(2018GXNSFDA281052)。

摘　　要：为了解决重复分簇而加剧能量消耗的问题,提出了一种新的无线传感器网络能效路由算法——基于簇树的非均匀分簇路由算法(UCCT)。该算法分为两步。第一步,划分网络区域为面积不相等的两个区域,对每个区域内的节点集,利用K-中心算法确定其质心节点;以每个质心作为一个簇,计算其中继能耗开销;确定各簇间的通信路由。第二步,利用线性规划方法来确定非质心节点所属的簇,选取各簇中剩余能量最高的节点为相应的簇头。该算法的特点是无须重复分簇。仿真结果表明,与ANRB相比,采用UCCT进行通信路由,无线传感器网络的寿命延长10.97%,数据吞吐量提高了13.09%。To address the problem of increasing energy consumption caused by repeating clustering,this paper proposed a novel energy-efficient routing algorithm for wireless sensor networks—uneven clustering routing algorithm based on cluster tree(UCCT),which was a two-stage algorithm.In the first stage,the algorithm divided network area into two regions with diffe-rent size.For each region,the algorithm used K-medoids to compute the center nodes in its node set,set each center node obtained as an initial cluster,calculated the relay energy consumption for each cluster,and then determined the routing of inter-cluster communication.In the second stage,the algorithm used linear programming method to add non-center nodes to the initial clusters for forming corresponding new clusters,and selected the node with highest residual energy as the cluster head in its corresponding cluster.The trait of the algorithm was that it didn’t need to repeat clustering.The simulation results show that for a given wireless sensor network,the network lifetime and the throughout obtained by UCCT algorithm are 10.97%and 13.09%more than those obtained by ANRB.

关 键 词：无线传感器网络 非均匀分簇 多跳通信 线性规划 

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