Research of WirelessHART Network Layer Routing Algorithm

Zhen Zhen Wu

doi:10.4028/www.scientific.net/AMM.336-338.1827

Paper Titles

Precision Laser Emission Technology Based on Fast Steering Mirror for Space Optical Communication
p.1809

Study of Load Shedding by IEC61850 Implementation
p.1814

Research on the QoS Routing Protocol Based on ACO Algorithm
p.1818

Design of Optical Fiber Communication Networks for Feeder Automation
p.1823

Research of WirelessHART Network Layer Routing Algorithm
p.1827

A Channel Allocation Algorithm Based on Minimum Interference in Wireless Mesh Network
p.1833

Precise Interference Signal Position Control Based on Tetrad of Antenna Array
p.1839

IrLAP Protocol Performance Analysis of IrDA Wireless Communications
p.1843

32-bit Datapath AES IP Core Based on FPGA
p.1848

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 336-338Research of WirelessHART Network Layer Routing...

Research of WirelessHART Network Layer Routing Algorithm

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.

You might also be interested in these eBooks

Industrial Instrumentation and Control Systems II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 336-338)

Pages:

1827-1832

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.336-338.1827

Citation:

Cite this paper

Online since:

July 2013

Authors:

Zhen Zhen Wu

Keywords:

Routing Algorithm, TinyOS, WirelessHART

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] HCF_SPEC-085, Revision 1. 2. Network Management Specification. HART communication foundation. 9 March, (2009).

Google Scholar

[2] HCF_SPEC-290, Revision 1. 1. WirelessHART Device Specification. HART communication foundation. 22 May, (2008).

Google Scholar

[3] SUN Jian-bo, SUN Qiang, SHEN Wei, ZHANG Ting-ting: Research on graph routing algorithm oil wireless HART networks. RAILWAY COMPUTER APPLICATION, 2011, 20(8): 35-38.

Google Scholar

[4] DANG Kui, SHEN Ji-zhong, DONG Li-da: Shortest-path routing algorithm based on selected RSL in WirelessHART. Computer Engineering and Applications, 2012, 48(6): 69-72.

Google Scholar

[5] LI Shi-bao, HONG Li: Research of AODV routing protocol based on neighbor cache. Journal of Computer Applications, 2011, 31(7): 1931-1933, (1943).

Google Scholar

[6] JIANG Wen-fang, ZHAO Li, MO Jin-wang. Development and implementation of AODV algorithm in wireless Mesh networks. Computer Engineering and Design, 2010, 31(15): 3383-3385, 3463.

Google Scholar