23.03.2017 Views

wilamowski-b-m-irwin-j-d-industrial-communication-systems-2011

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4-8 Industrial Communication Systems<br />

After this, a new one is explained—Dynamic MANET On-Demand (DYMO), which has been published<br />

as Standard Track RFC.<br />

Along similar lines, three more routing protocols used in WSNs are explained. These are Sensor<br />

Protocols for Information via Negotiation (SPIN), which are classified as flat routing protocols, and Low<br />

Energy Adaptive Clustering Hierarchy (LEACH) protocol, and Geographic Adaptive Fidelity (GAF),<br />

which is a location-based routing protocol.<br />

4.5.1 Optimized Link-State Routing Protocol<br />

OLSR [JMC01] is a proactive routing protocol based on the link state algorithm. It is in experimental<br />

state in the IETF Working Group [CJ03].<br />

Each node maintains a route to the rest of the nodes in the ad hoc network. The nodes forming<br />

the network exchange messages about the link state periodically, but they use the multipoint relaying<br />

(MPR) strategy to minimize both, the routing message size and the number of nodes that resend the<br />

routing messages in broadcast mode. In the MPR [BCGS04] strategy, each node uses “Hello” messages<br />

to find out which nodes are placed at one hop distance and a list is created, see Figure 4.3.<br />

Each node selects in that list a subset of neighbor nodes able to reach every node at a distance of<br />

two hops from the node that is making the selection. Only these selected neighbor nodes will be used<br />

to retransmit the routing messages, and these are called multipoint relays. The rest of the neighboring<br />

nodes will process the routing messages they receive, but they will be unable to retransmit them. Each<br />

node determines the best route (in number of hops) for each destination, using the information stored<br />

(in the routing table of the topology and in that of their neighbors) [AWD04], and stores that information<br />

in a routing table, so that it is available at the precise moment when a node wants to start sending<br />

data. This protocol selects bidirectional links to send messages [ChCL03], dispensing with unidirectional<br />

links. OLSR is well suited to large, dense mobile networks. Because of the use of MPRs, larger and<br />

denser networks link state routing offers optimum performance.<br />

4.5.2 topology Dissemination Based on Reverse Path Forwarding<br />

Topology Dissemination Based on Reverse-Path Forwarding [OTL04] is a proactive, link-state routing<br />

protocol designed for mobile ad hoc networks, which provides hop-by-hop routing along shortest<br />

paths to each destination. Each node running TBRPF computes a source tree based on partial topology<br />

information stored in its topology table, using a modification of Dijkstra’s algorithm. To minimize overhead,<br />

each node reports only part of its source tree to neighbors. TBRPF uses a combination of periodic<br />

and differential updates to keep all neighbors informed of the reported part of its source tree. Each<br />

node also has the option to report additional topology information, to provide improved robustness<br />

B<br />

MPR nodes<br />

Source node<br />

A<br />

S<br />

C<br />

FIGURE 4.3<br />

OLSR multipoint relay selection.<br />

© <strong>2011</strong> by Taylor and Francis Group, LLC

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!