Abstract
WirelessHART, a kind of wireless mesh communication network that suits process automation, are widely used in the industrial fields. Routing algorithm performance directly determines sensor nodes how to transfer and control data, and the effective data rate. The algorithm which affects the energy consumption and lifetime of the whole sensor network is the core content of the network layer. WirelessHART network layer routing algorithm includes Source Route and Graph Route. In this paper, WirelessHART routing algorithm is simulated using nesC language in the TinyOS, and then compares with AODV protocol. And the data of experiment show the application advantage of WirelessHART Graph Route.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
