A Reliable Multipath Routing Strategy for WirelessHART Mesh Networks Using Subgraph Routing

Provided by: Binary Information Press
Topic: Networking
Format: PDF
The graph routing protocol proposed by wireless Highway Addressable Remote Transducer (HART) is one of the robust routing protocol in wireless networks. Since there are a few algorithms about graph routing at present and the performance is poor, a reliable multipath graph routing algorithm, Optimized Reliable Multipath Graph Routing (ORMGR) is presented. In ORMGR, the network is defined as a connected graph. It then generates the binary tree from a node to the given destination node on-demand and the sub-graph that includes all the edges of the binary tree. As for packet transmission, there are no fixed paths from the source node to the destination node, because ORMGR ensures hop-by-hop multipath.

Find By Topic