基于非均匀分环与最小通信代价的路由算法  

A Routing Algorithm Based on Unequal Ring and Minimum Communication Cost

作　　者：尚静 董增寿[1] 康琳[1] SHANG Jing;DONG Zengshou;KANG Lin(College of Electronics and Information Engineering,Taiyuan University of Science and Technology,Taiyuan 030024,China)

机构地区：[1]太原科技大学电子信息工程学院,太原030024

出　　处：《传感技术学报》2018年第3期449-455,共7页Chinese Journal of Sensors and Actuators

基　　金：国家自然科学基金项目(41272374);山西省青年科技研究基金项目(2014021021-2);晋城市科技计划项目(201501004);太原科技大学博士启动基金项目(20162030);山西省青年基金项目(20171042)

摘　　要：为了提高无线传感器网络的生命周期,提出了一种基于非均匀分环与最小通信代价的路由算法URMC。算法采用圆环模型,首先为各环分配不同的簇头选择概率;其次以各环节点能耗均衡为目标,推导出各环宽度的表达式;最后通过设计通信代价公式来选择簇头和建立簇间路由树。最终形成一个节点能耗均衡、簇间路由合理的网络。经仿真验证,URMC算法能有效克服能量空洞现象,延长网络的生存周期。A routing algorithm based on unequal ring and minimum communication cost(URMC)was proposed to prolong the lifetime of the wireless sensor network.The URMC algorithm uses the ring model to assign the different cluster head selection probabilities for each ring firstly.Secondly,from the objective of energy consumption balanced of each ring,the expression of the ring width was deduced.Finally,the communication cost formula was designed to select the cluster head and create inter-cluster forwarding tree.A node energy balanced and reasonable inter-cluster forwarding network was formed ultimately.The simulation results show that URMC algorithm can overcome the energy-hole effectively and prolong the lifetime of the network.

关 键 词：无线传感器网络 非均匀分环 最小通信代价 能耗均衡 能量空洞 

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