对无线HART网络的图表路由算法的研究  

Research on graph routing algorithm on wireless HART networks

作　　者：孙健波[1] 孙强[1] 申巍[2] 张婷婷[2] 

机构地区：[1]北京交通大学电子信息工程学院,北京市100044 [2]中瑞典大学信息科技媒体学院,松兹瓦尔市85170

出　　处：《铁路计算机应用》2011年第8期35-38,共4页Railway Computer Application

摘　　要：在无线HART网络层协议中图表路由算法被规定为常规的路由方法。协议仅对图表路由算法进行了定义以及规定了其特点,并没有实现明确的仿真以及评估,本文在TinyOS中运用nesC语言对图表路由算法进行仿真,并且在吞吐量、延迟2个方面与AODV协议进行对比评估,通过TinyOS模拟仿真和评估可以看出,图表路由算法在无线HART网络中具有明显优势。According to the wireless HART network layer protocol,graph routing algorithm was proposed as the normal routing method.The protocol only defined and provided the property of graph routing algorithm,didn＇t implemented the simulation and evaluation.In this paper,the graph routing algorithm was first simulated by nesC coding language in TinyOS,then the evaluation was made with AODV from two aspects： throughput,latency.Through TinyOS simulation and evaluation,it was demonstrated that graph routing algorithm had a great advantage in wireless HART networks.

关 键 词：wHART 图表路由算法 AODV TINYOS 

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