Documente Academic
Documente Profesional
Documente Cultură
ABSTRACT
In an earlier work, we proposed the OptPathTrans algorithm to minimize the number of
path transitions during a source-destination (s-d) session in a mobile ad hoc network. The
sequence of longest-living stable paths determined over the duration of the s-d session is
called the Stable Mobile Path (SMP). But, the average hop count per static path for SMP
is significantly larger than the minimum required hop count for a path between the source
and destination. Also, algorithm OptPathTrans requires complete knowledge about future
topology changes over the duration of the s-d session. In this paper, we illustrate the
effectiveness of predicting the future topology changes using the location and mobility
information of the nodes in the form of Location Update Vectors (LUVs) learnt at the
time of determining a static stable path of the SMP. The modified algorithm is referred to
as OptPathTrans-LUV and the sequence of predicted static stable paths (that also actually
exists) is referred to as SMP-LUV. Simulation results illustrate that the average lifetime
per static path of SMP-LUV can be as large as 88% of the lifetime per static path
obtained for SMP. On the other hand, the average hop count per static path of SMP-LUV
can be as low as 80% of the hop count per static path for SMP.
Keywords: Stability, Hop Count, Path Lifetime, Simulations, Location Prediction
INTRODUCTION
Volume 4 Number 5
Page30
www.ubicc.org
Volume 4 Number 5
Page31
successive
flooding-based
broadcast
route
discoveries initiated by LPBR.
The rest of the paper is organized as follows:
Section 2 describes the original algorithm
OptPathTrans. Section 3 describes the proposed
OptPathTrans-LUV. Section 4 illustrates the path
lifetime and hop count obtained for algorithms
OptPathTrans and OptPathTrans-LUV and compares
them with respect to the lifetime and hop count of
minimum hop paths over the same period of
simulation time. Section 4 also illustrates the tradeoff
between path lifetime and hop count for stabilitybased and minimum-hop based routing. Section 5
concludes the paper.
2
ALGORITHM TO
DETERMINE THE
OPTIMAL
NUMBER
OF
PATH
TRANSITIONS (OptPathTrans)
2.1 Terminology
A mobile graph [6] is defined as the sequence
GM = G1G2 GT of static graphs that represents the
network topology changes over some time scale T. In
this research work, we sample the network topology
periodically for every 0.25 seconds (i.e., 4 network
snapshots per second), which could in reality be the
instants of data packet origination at the source.
A mobile path [6], defined for a sourcedestination (s-d) pair, in a mobile graph G M = G1G2
GT is the sequence of paths PM = P1P2 PT,
where Pi is a static path between the same s-d pair in
Gi = (Vi, Ei), Vi is the set of vertices and Ei is the set
of edges connecting these vertices at time instant ti.
That is, each static path Pi can be represented as the
sequence of vertices v0v1 vl, such that v0 = s and vl
= d and (vj-1,vj) Ei for j = 1,2, , l. The timescale
of tT normally corresponds to the duration of a
session between s and d.
The Stable Mobile Path (SMP) for a given
mobile graph and s-d pair is the sequence of static sd paths such that the number of route transitions is as
minimum as possible. A Minimum Hop Mobile Path
(MHMP) for a given mobile graph and s-d pair is the
sequence of minimum hop static s-d paths.
2.2 Algorithm OptPathTrans
Algorithm OptPathTrans operates on the
following greedy strategy: Whenever a path is
required, select a path that will exist for the longest
time. Let GM = G1G2 GT be the mobile graph
generated by sampling the network topology at
regular time instants t1, t2, , tT of an s-d session.
When an s-d path is required at sampling time instant
ti, the strategy is to find a mobile sub graph G(i, j) =
Gi Gi+1 Gj such that there exists at least
one s-d path in G(i, j) and no s-d path exists in G(i,
j+1). A minimum hop s-d path in G(i, j) is selected.
www.ubicc.org
i=j+1
end while
return PS
End OptPathTrans
Figure 1: Pseudo code for algorithm OptPathTrans
2.3 Complexity of Algorithm OptPathTrans
In a mobile graph GM = G1G2 GT, the number
of route transitions can be at most T. A path-finding
algorithm will have to be run T times, each time on a
graph of n nodes. If we use O(n2) Dijkstra algorithm
[7], where n is the number of nodes in the network,
the worst-case run-time complexity of OptPathTrans
is O(n2T).
3
VECTORS (OptPathTrans-LUV)
Volume 4 Number 5
Page32
www.ubicc.org
while (i T) do
PS-LUV = PS-LUV U {Minimum hop predicted sd path that exists in both Gpred(i, j) and
Gaactual(i, j)}
i=j+1
end while
return PS-LUV
End OptPathTrans-LUV
Volume 4 Number 5
Page33
SIMULATIONS
www.ubicc.org
Figure 3: Average Lifetime per Static Path in the Mobile Path (Square Network Topology)
Figure 4: Average Lifetime per Static Path in the Mobile Path (Circular Network Topology)
Figure 5: Average Hop Count per Static Path in the Mobile Path (Square Network Topology)
Figure 6: Average Hop Count per Static Path in the Mobile Path (Circular Network Topology)
static path p2, and a 2-hop static path p3, with each
existing for 2, 3 and 5 seconds respectively, then the
time-averaged hop count of the mobile path would be
(2*2 + 3*3 + 2*5)/10 = 2.3.
4.1 Average Path Lifetime
For a given level of node mobility, as we
increase the network density, the difference in the
lifetimes of the paths discovered by algorithms
OptPathTrans and OptPathTrans-LUV increases.
OptPathTrans effectively makes use of the increased
availability of the nodes and the knowledge of the
locations of the nodes over the entire simulation time
period and determines stable paths with the longest
lifetime. Both the Minimum-hop based routing
Volume 4 Number 5
Page34
www.ubicc.org
Volume 4 Number 5
Page35
www.ubicc.org
ACKNOWLEDGMENTS
CONCLUSIONS
Volume 4 Number 5
Page36
REFERENCES
www.ubicc.org
[5]
[6]
[7]
[8]
Volume 4 Number 5
Page37
www.ubicc.org