ELHFR: A Graph Routing in Industrial Wireless Mesh Network
Graph routing is proposed in wirelessHART communication foundation, but the implementing of the algorithm is not specified. This paper proposes a graph routing mechanism termed ELHFR (EXHENCED LEAST-HOP FIRST ROUTING) that exploits the mesh topology and application characteristics of wirelessHART. ELHFR defines the network topology as a connected graph then generates the sub-graph that includes all the shortest paths from a node to the given destination. ELHFR does not need find the shortest paths of all nodes in the network, but only of the special nodes that are leaves of a breadth first tree. After several sub-graphs of topology graph are generated, the shortest paths to the destination of ever node can be found in them. The routing generating algorithm is presented in detail, as well as the routing updating mechanism. We analyze the ELFHR to provide intuitive understanding of its performance, and simulate it in OMNet++ subsequently. The simulation result shows that significant improvement over AODV routing in aspects of reliability and stability, which are the important requirements of industrial wireless network.
Zhao Jindong Liang Zhenjun Zhao Yaopei
School of Information Engineering at University of Science and Technology Beijing,Beijing,100086 CHI Wenjing College,Yantai University,Yantai,SD 264005 CHINA
国际会议
2009 IEEE International Conference on Information and Automation(2009年 IEEE信息与自动化国际学术会议)
珠海、澳门
英文
106-110
2009-06-22（万方平台首次上网日期，不代表论文的发表时间）