Ad Hoc Networks : Technologies and Protocols - University of ...
Ad Hoc Networks : Technologies and Protocols - University of ...
Ad Hoc Networks : Technologies and Protocols - University of ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
108 Multicasting in <strong>Ad</strong> <strong>Hoc</strong> <strong>Networks</strong><br />
will have more than one cores. One <strong>of</strong> the cores will emerge as the “winning”<br />
core <strong>of</strong> the unified mesh due to the core resolution algorithm.<br />
The core is responsible for initiating the tree creation process, which identifies<br />
the subset <strong>of</strong> the links within the mesh to form the shared data delivery<br />
tree. The core sends out periodic TREE-CREATE messages along all the links<br />
incident on it in the mesh. Group members receiving non-duplicate TREE-<br />
CREATE messages forward them on all mesh links except the incoming, <strong>and</strong><br />
mark the incoming <strong>and</strong> outgoing links as tree links. If a duplicate TREE-<br />
CREATE message is received, a TREE-CREATE-NAK is sent back along the<br />
incoming links, which makes both end nodes <strong>of</strong> the mesh link mark it as mesh<br />
link instead <strong>of</strong> a tree link.<br />
AMRoute operates independent <strong>of</strong> the underlying unicast protocol. This<br />
independence allows use <strong>of</strong> the optimal ad hoc unicast protocol for the network<br />
<strong>and</strong> can work transparently across domains supporting different unicast<br />
protocols.<br />
4.3.6 Location Aided Multicasting<br />
In networks where Global Positioning System (GPS) is available, each node<br />
is provided with the location <strong>and</strong> mobility information. The location aided<br />
routing techniques are utilized by the unicast protocols. The multicast protocols<br />
can also utilize this information for improving protocol robustness, or even<br />
making forwarding computation.<br />
With GPS support, ODMRP [4] can be made adaptive to node movements<br />
by utilizing mobility prediction. By using location <strong>and</strong> mobility information,<br />
route expiration time can be estimated <strong>and</strong> receivers can select the path that<br />
will remain valid for the longest duration. With the mobility prediction method,<br />
sources can reconstruct routes in anticipation <strong>of</strong> route breaks. Thus, the protocol<br />
can be more resilient to node mobility.<br />
Location Guided Tree Construction Algorithm for Small Group Multicast<br />
(LGT) [8] is also an overlay multicast protocol, where multicast data is encapsulated<br />
in a unicast packet <strong>and</strong> transmitted among group members. Using<br />
the location information <strong>of</strong> the group member nodes, the multicast tree is constructed<br />
without the knowledge <strong>of</strong> the network topology. The authors propose<br />
two types <strong>of</strong> heuristics, namely the location-guided k-array tree (LGK), <strong>and</strong> the<br />
location-guided Steiner tree (LGS) to construct the multicast tree with location<br />
information.<br />
4.3.7 Gossip-Based Multicasting<br />
Gossip, as a form <strong>of</strong> probabilistically controlled flooding, has been used to<br />
solve a number <strong>of</strong> problems such as network news dissemination. The basic idea<br />
<strong>of</strong> applying gossip to multicasting is to have each member node periodically