基于非均匀成簇的无线传感器网络多跳路由算法  

Multi-hop Routing Algorithm for Wireless Sensor Networks Based on Uneven Clustering

作　　者：吴标[1] 崔琛[1] 余剑[1] 易仁杰[1] WU Biao CUI Chen YU Jian YI Ren-jie(401 Laboratory, Electronic Engineering Institute, Hefei 230037, China)

机构地区：[1]电子工程学院401室,合肥230037

出　　处：《计算机科学》2017年第2期157-162,共6页Computer Science

基　　金：电子工程学院院控基金(KY13A206)资助

摘　　要：针对复杂、不规则场景下无线传感网络的高效能组网问题,提出了一种基于非均匀成簇的无线传感器网络多跳路由算法MRAUC。根据应用场景形状不规则、汇聚节点远离检测区域等特点,首先将检测区域近似成汇聚节点位于扇心的扇环,建立了扇型场景下无线传感器网络的非均匀成簇模型;通过等间隔划分扇环,以第一扇环能耗最小为原则确定各扇环的簇首数目,进一步推导出各扇环内的最佳簇首比例;通过簇首发射功率的自适应调整实现非均匀分簇;同时,以MTE原则竞选出最佳中继簇首,有效解决了簇首间的路由中继问题。仿真结果表明,与传统算法相比,在不同应用场景下所提MRAUC算法在均衡网络节点能耗、延长网络生命周期方面具有显著优势,更适用于工程实际。Aiming to solve the highly efficient networking problem of wireless sensor networks（WSN）under a complex and irregular scenario,a multi-hop routing algorithm based on uneven clustering（MRAUC）was proposed for wireless sensor networks.Firstly,according to the characteristics that irregular shape of the scenario and the sink node are far away from the detection area,the algorithm approximates the detection area into anannular sector of which the sink node is located in the heart.Based on the annular sector scenario,the uneven clustering is established for wireless sensor networks.The detection area is divided into annular sectors with equal segmentation,then the cluster head number and the best proportion of each annular senctor are determined by the minimum energy consumption of the first annular senctor.Through adaptively transmitting power of cluster head,the uneven clustering is realized.At the same time,the best relaying cluster head is determined by the MTE principle,which effectively overcome the routing relaying problem between cluster heads.The simulation results show that compared with the traditional algorithm,the new algorithm has significant advantages in balancing energy consumption between nodes and prolonging the network life cycle.As a result,it is more suitable for engineering practice.

关 键 词：无线传感器网络 非均匀成簇 扇环 多跳路由 

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