一种改进的基于时间竞争成簇的路由算法  

A Modified Routing Algorithm Based on Time Competition Clustering

作　　者：孙振 王凯 王亚刚[1] SUN Zhen;WANG Kai;WANG Yagang(School of Optical-Electrical and Computer Engineering,University of Shanghai for Science and Technology,Shanghai 200093,China;Shanghai Publishing and Printing College,University of Shanghai for Science and Technology,Shanghai 200093,China)

机构地区：[1]上海理工大学光电信息与计算机工程学院,上海200093 [2]上海理工大学上海出版印刷高等专科学校,上海200093

出　　处：《电子科技》2019年第8期27-32,共6页Electronic Science and Technology

基　　金：国家自然科学基金(61074087)~~

摘　　要：为平衡无线传感器网络中的簇头负载并进一步降低多跳传输能耗,文中提出了一种改进的基于时间竞争成簇的路由算法。该算法通过限制近基站节点成簇入簇,以防止近基站节点成簇入簇的节能收益无法补偿成簇入簇能耗;利用基站广播公共信息和基于时间机制成簇,以减少节点基本信息交换能耗;通过候选簇头中继来平衡簇头负载。候选簇头的评价函数综合考虑了剩余能量和最优跳数的理想路径,以期在保持中继负载平衡的基础上尽量降低多跳能耗。仿真结果显示,该算法较LEACH和DEBUC算法延长了以30%节点死亡为网络失效的网络生存周期,表明该算法在降低节点能耗和平衡负载方面是有效的。To balance load of cluster heads in wireless sensor networks and reduce extra energy consumption, this paper proposed a modified routing algorithm based on time competition clustering. Firstly, the algorithm limited sensors closed to base station into cluster to avoid that clustering energy saving benefits could not compensate for the cluster energy consumption. Secondly, the algorithm used base station broadcast common messages and clustered with time competition to reduce energy consumption for basic information exchange. Thirdly, the algorithm chose nodes according to optimal hops and high residual energy in candidates of cluster-heads as next relay node. In this way, the algorithm could balance load of cluster heads and save more energy. As shown in the simulation experiment, compared with LEACH and DEBUC, the algorithm prolonged network lifetime which used 30% nodes death as network failure, indicating the algorithm was valid in decreasing energy consumption and balancing load.

关 键 词：无线传感器网络 路由算法 成簇 LEACH 最优跳数 候选簇头 

分 类 号：TN926[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]