Research on graph routing algorithm on wireless HART networks
Tingting Zhang · Railway Computer Application · 2011
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.