基于加权优化树的WSN分簇路由算法  

A WSN Cluster Routing Algorithm Based on the Optimized-Weighting Tree

作　　者：刘一珏 王军 LIU Yi-jue;WANG Jun(Shenyang University of Chemical Technology,Shenyang 110142,China)

机构地区：[1]沈阳化工大学计算机科学与技术学院,辽宁沈阳110142

出　　处：《沈阳化工大学学报》2020年第2期178-186,共9页Journal of Shenyang University of Chemical Technology

基　　金：辽宁省自然科学基金项目(2015020082)。

摘　　要：无线传感器网络(WSN)是由大量具有感知和传输数据能力的传感器节点组成的自组织网络,被用来部署监测物理环境.针对无线传感器节点存储空间小、能量有限、路由不稳定、能耗不均衡等问题,提出一种改进的基于加权优化树的路由算法,将树型结构应用于分簇路由算法中.根据节点的剩余能量、可用内存、相邻节点的距离、信道质量设定数据传输代价,并以此为基础对树型拓扑结构进行加权优化,分布式地在簇内创建树型网络拓扑结构.改进的算法降低了网络中数据传输的总代价.仿真实验结果表明:与传统的树结构和分簇路由算法相比较,结合了树型拓扑结构的分簇路由算法,在延长网络生存时间和平衡网络能耗方面更具有优势.Wireless sensor network(WSN)which includes a large number of sensor nodes with sensibi-lity and data transfer capability is a wireless self-organizing network,using to deploy the detection physical environment.Aiming on the small storage space of wireless sensor nodes,limited energy,unstable routing,unbalanced energy and soon,propose an improved routing algorithm based on the optimized-weighting tree which applying the tree structure to cluster routing algorithm.Based on the data transfer cost according to the residual energy of the node,available memory,distance between adjacent nodes and channel quality to weighted optimum the tree topology,and distributed to create tree network topology in cluster.The improved algorithm reduces the total cost of data transmission in the network.Results of simulation experiment indicate that,compared with traditional tree structure and clustering routing algorithm,and combining the two above hasadvantages over extending network survival time and balancing network energy consumption.

关 键 词：树型结构 分簇路由算法 网络生存时间 能量均衡 数据传输代价 

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