|
|
Araneola, a
system for scalable reliable multicast in dynamic wired network
environments, employs a protocol that builds and maintains a k-regular
overlay. It exploits the good properties
of random regular graphs (high connectivity and diameter that grows
logarithmically with network size), to provide reliable, scalable and
efficient message dissemination. We
investigate the suitability of Araneola's probabilistic overlay
creation and deterministic data dissemination mechanism in the ad-hoc
environment.
Initially, we define partial group view and overlay neighboring nodes
in terms of link-level reachability and attempt to build a protocol
that builds a per-hop random regular graph structure. We show that this
protocol reduces to an inefficient version of controlled flooding.
Consequently, we consider the use of an optimized unicast tunneling
mechanism to improve the randomness and connectivity of the regular
overlay. Araneola relies on a membership view tracking mechanism.
Existing partial view membership protocols for the wired networks do
not adapt to the limited ad-hoc connectivity and do not efficiently
utilize the resource constraint medium. Hence, we replace the LPB-like
membership track algorithm with the route-driven view mechanism of a a
rudimentary gossip protocol (RDG), which associates a view with the
route state of a reactive routing protocol. We perform numerous
modifications on the base Araneola, to allow it to cope with the
idiosyncrasies of the mobile wireless environment.
We perform extensive simulation-based evaluation of our approach in
environments with both multicast and unicast traffic, comparing it to
application layer rumor mongering, to Araneola that relies on ad-hoc
link-state routing and to variations of flooding. The experimental
results allow us to determine the range of ad-hoc network
configurations in which deterministic overlay flooding leverages
epidemic application layer multicast.
In terms of reliability and control overhead, under low mobility,
Araneola's deterministic flooding compares favorably to gossip.
However, as topology volatility increases, the latter is more adaptable
and degrades more gracefully. When compared to overlay multicast, link
layer flooding variations exhibit higher reliability and efficiency for
multicast-only traffic. However, the introduction of unicast traffic
amortizes the route resolution overhead and renders the proposed
approach more viable.
Related
Documentation
1)
Michael Sirivianos. Epidemic
Overlays for
Multicast In Ad-Hoc Networks. UCSD MS Thesis.
2)
Michael Sirivianos. Overlay
Multicast In Mobile Ad-hoc Networks Using Araneola. UCI
TR #07-02
Source Code
This tarball
contains the following Glomosim modules: a) Ad-hoc Araneola;
b) DSR with
support for route-driven views; c) Route Driven Gossip and d) Link-level
flooding. Please contact me for additional modified Glomosim
code. Glomosim
is distributed under a restrictive license.
|