基于Dijkstra能量均衡的无线HART图路由算法  

Energy balance graph routing algorithm based on Dijkstra for wireless HART networks

作　　者：向敏[1] 唐亮[1] 王平[1] 

机构地区：[1]重庆邮电大学工业物联网与网络化控制教育部重点实验室,重庆400065

出　　处：《仪器仪表学报》2016年第11期2628-2636,共9页Chinese Journal of Scientific Instrument

基　　金：国家高技术研究发展计划(863计划)课题(2015AA043801);重庆市前沿与应用基础研究计划(cstc2015jcyjA40007)项目资助

摘　　要：针对工业无线HART网络生存时间受节点能量限制的问题,提出一种能量高效均衡的图路由算法(EEBGR)。该算法构建了适合无线HART图路由的新型层次化网络拓扑结构,在求取该拓扑图边的权值时,综合考虑节点能量均衡性指标、流量负载指标和链路传输能耗的影响因素,进而构建出复合权值有向图,并利用改进的Dijkstra算法为各节点决策最小代价的多路径子图路由,以达到全网节点能耗均衡。测试结果表明EEBGR算法有效地减少了无线HART网络单个节点能耗、均衡了网络能量分布、延长了网络生存时间。Aiming at the problem that the survival time of industrial wireless HART network is restricted by the energy of the nodes,a novel energy efficient and energy balance graph routing algorithm（ EEBGR） is proposed. This algorithm constructs a new hierarchical network topology structure suitable for the graph routing of wireless HART network. When solving the weights of the topology graph,the influence factors of the node energy balance, traffic load and link circuit transmission power consumption are considered comprehensively,and a composite weight directed graph is constructed. The improved Dijkstra algorithm is adopted to assign the multipath sub-graph routing with the least cost for the nodes,and the energy balance of the nodes in whole network is achieved.Simulation results show that the proposed EEBGR algorithm effectively reduces the energy consumption of the nodes in wireless HART network,balances the network energy distribution and prolongs the survival time of the wireless HART network.

关 键 词：无线HART 图路由 能量均衡 复合权值 DIJKSTRA 

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