Minimum-Hop Load-Balancing Graph Routing Algorithm for Wireless HART
Keywords:
Graph routing, load balancing, minimum hop, wirelessHARTAbstract
In this paper load-balancing routing algorithm for
WirelessHART standard is proposed. WirelessHART is open
standard for Industrial automation to fulfill specific
requirements of industrial environments, WirelessHART is
secure, time synchronized mesh network with frequency
hopping and graph routing. Graph routing is used in
WirelessHART to provide path redundancy. Whereas in
proposed algorithm; not only path redundancy is considered
but also minimum hop end to end communication to fulfill
stringent real time requirements as well as device load
balancing is considered to increase overall network life. Results
show that network life with proposed algorithm is dramatically
increased in comparison with minimum hop graph routing
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
