Font Size: a A A

Research Of Graph Routing Protocol Based On TinyOS In WirelessHART Networks

Posted on:2012-10-27Degree:MasterType:Thesis
Country:ChinaCandidate:J B SunFull Text:PDF
GTID:2178330332475382Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
HART (Highway Addressable Remote Transducer) Protocol is a worldwide standard and its products are widely used on smart field devices. With wireless communication technology's progress, WirelessHART technology is designed. But WirelessHART protocol is just released so little individuals and organizations are doing the research in this area, the commercial platform for researching the protocol has not been built too, so researching WirelssHART Networks'key techniques has an ingenious scientific meaning.Based on the careful research of WirelessHART communication protocol, we mainly work on three aspects:First, we go deep into the study of source routing and graph routing. We do not only anatomize their definition, feature, flow chart, function and application but also using examples to illustrate. Second is we simulate graph routing by using the simulation software TinyOS and coding language NesC. The simulation work including the upstream and downstream communication, the complex multi-nodes communication is also completed. Finally, based on the successful simulation work of graph routing, we also simulate AODV routing protocol. Then we evaluate the performance of the two routing protocols from three aspects:throughput, packet delivery rate and latency. The evaluation result shows that graph routing has some advantages than AODV in WirelessHART Networks and latency is most obvious.The first chapter introduces the overview of WirelessHART Networks. In chapter two, the key technique of WirelessHART is analysed, the architecture and application is also presented. Chapter three researches on source routing and graph routing protocol, in order to make the evaluation with graph routing conveniently, the reactive routing protocol AODV is also introduced here. In chapter four we worked on the TinyOS software. The developing and using of TinyOS in WirelessHART Networks is introduced particularly. The process of simulating graph routing in TinyOS is presented in this part. In chapter five the simulation result is shown. The evaluation result such as throughput, packet delivery rate and latency is also presented vividly. In the last chapter, the paper gives a whole summary and future view.
Keywords/Search Tags:WirelessHART Networks, Graph Routing, AODV, TinyOS
PDF Full Text Request
Related items