International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 6June 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 1687

STABLE ROUTING IN MANETS USING RD MOBILITY MODEL
Mr.I.S.Raghuram, Mr.B.Hari Santhosh Rao, Mr.M.Gunasekhar, Miss.G.Geetha Lakshmi
Dept. of CSE, Kurnool

Abstract
The route efficiency can improve by selecting of the
optimum path between any two nodes in MANTES.
A method has been chosen for selecting the most
stable path, to abridge the latency and the overhead
due to route repath. We say the duration probability
and accessibility of a route path which is affected to
link failures made by node mobility. We focus on the
Direction of the nodes in the network travel
accordant to the RD model. Through our results, we
say the problem of path accessibility, to choosing an
optimum route.
Index Terms - Mobile adhoc networks, routing,
modeling and analysis.
1 Introduction
The need for mobile wireless communication is fatal,
with the ever increasing demand for connectivity.
There is a Rapid increase in the use of the portable
laptops and hand held devices. Many of the portable
communication devices have the support of fixed
base stations or access points and incoming routers
for communication purposes. This style can be
Discover in wide-area wireless cellular systems. Still,
such type of support is not available in settings where
access to a wired infrastructure is not practical.
Situations like natural disasters, conferences and
military settings are note worthy in this regard. This
has led to the need for Mobile Ad-hoc Networks. A
mobile ad-hoc network is a network of mobile
devices that are dynamically changing which
communicate without the support of a fixed structure.
There is a direct communication between the adjacent
devices, but a non-adjacent device requires a robust
and intelligent routing strategy to check reliable and
efficient communication.
The random direction model is less attractive
physically; it is much easier to understand. User
speeds are easily calculated, unlike for the waypoint
Model, and, as we will observe, user positions and
directions are uniformly distributed Mobility
Random Direction model is one of the most popular
mobility models to evaluate other Mobile ad hoc
network (MANET) routing protocols, because of its
simpleness and wide accessibility. This model has
been used in many simulation studies. The Random
Direction model is a random-based mobility model
used for mobile communication systems in mobility
management schemes. The mobility model is
designed to describe the movement pattern of mobile
users, their location, velocity and acceleration and
how they change over time. Mobility models are used
for simulation purposes when new network protocols
are evaluated.
The mobile nodes move randomly and freely without
restrictions in random-based mobility simulation
models. To be more unique, the destination, speed
and direction are all chosen randomly and
independently of other nodes.
In this particular, we focus on the stability of a
routing path caused by node mobility which is
subject to link failures. We define the path duration
as the time interval from when the route is
established until one of the links along the route
becomes inaccessible clearly the probabilities of path
duration and path accessibility strongly depend on the
mobility pattern of the network nodes. The path
duration is discovered by the duration of its links,
which on its turn depends on the movement of a node
with respect to the other. To characterize the nodes
position with respect to each other we need the
spatial distribution of a single node over time. One
would like to be able to evaluate these quantities in
presence of various mobility models; however the
analysis is extremely difficult even under simple
mobility patterns for a detailed discussion of related
work and previous results.)
Here we focus on bidirectional random mobility, and
we conceive nodes moving accordant to the Random
Direction (RD) mobility model, which was first
introduced in. Accordant to this model, each node
surrogates periods of movement i.e. move phase to
periods during which it pauses i.e. pause phase, at the
opening of each move phase, a node independently
selects its speed and new direction of movement.
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 6June 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 1688

Speed and direction are kept stable for the whole
duration of the node move phase.
The important contributions of our work are as
follows: We derive an expression of a node moving
accordant to the RD model. This expression can be
numerically turned to obtain the temporal evolution
of the probability density function of the node
position, given an assigned initial condition. We
suggest a simple, close expression for the probability
of link accessibility under the RD model, which leads
the derivation of the second moment of the node
spatial distribution. Our findings suggest that as time
continues, the probability of link accessibility under a
generic mobility model can be incurred through a
corresponding estimation. The same approach can be
applied to the computation of the probability of path
duration.
2 Why should Analysis of Route Stability
Necessary?
To deal with the quality-of-service requirements of
mobile users, metrics can be considered for selecting
a source destination routing path. Some examples can
be found in, where the critical issue of energy
consumption is considered, or in where the selection
of high throughput routes is addressed. Here, we
focus on route stability, which is a view of
importance as one can estimate from the following
conditions. To maximize throughput and abridge
traffic latency, it is essential to check reliable source-
destination connections over time. According some
knowledge of the nodes motion and on a probability
model of the path future accessibility a route should
be selected based.
Network connectivity: Link dynamics determined
Connectivity and topology characteristics of a
MANET. These are considerable issues to network
design, since they find the system capability to
support user communications and their reliability
level. The performances achieved by high-layer
protocols, such as transport and application protocols,
heavily depend on the quality-of-service metrics
incurred at the network layer. The duration and
frequency of route disruptions have a considerable
impact on TCP as an example.
Efficient route repair: If an estimate of the path
duration is available, service disruption due to route
failure can be quashed by creating an alternative path
before the current one breaks.
3 Assumptions
During the study of accessibility and path duration in
MANETs, we attain the following assumptions:
1. The network consist of nodes which are
homogeneous and are moving over a bidirectional
area , all nodes have the same mobility pattern, and a
common radio range R.
2. Nodes are moving independently of each other.
3. A free space propagation model is considered, i.e.,
the received signal only depends on its distance from
the transmitter.
4 Random Direction Model Link Accessibility and
Link Duration
We conceive the Random Direction model, i.e., each
node alternates periods of movement (move phase) to
periods during which it pauses (pause phase); at the
opening of each move phase, a node independently
selects its new direction and speed of movement.
Speed and direction are kept stable for the whole
duration of the node move phase; the durations of
move and pause phases are, in general, distributed
accordant to independent random variables. Under
the RD model, the temporary evolution of the node
position, either in the move or in the pause phase, can
be described through a system of partial differential
equations (PDEs). In weak solution of these
equations has been incurred over a finite rectangular
area. Here rather, we conceive the dynamics of nodes
moving over an infinite bidirectional domain and we
prevail a closed expression for the general solution of
the RD equations in the frequency domain, under the
assumption that move and pause times are
exponentially distributed. Even if a direct analytical
inverse transform of the incurred moment-generating
function appears to be prohibitive, closed expressions
for the moments of the spatial probability density
function can easily be deduced. By using the node
spatial distribution, we write a precise expression for
the probability of link accessibility, and then suggest
a simple estimation to evaluate this metric based on
the second moment of the spatial distribution, which
provides satisfactory results.
4.1 Spatial Distribution of Node
The node movement dynamics can be described over
a general state space, in which the instant node state
is characterized by
1) The phase p (u)P={move,pause},
2) The instant position X (u), and
3) The current speed V (u) to be specified only when
P (u) =move).
Let m(x, v, u) be the pdf at time t of the node in the
move phase, over the state space initiated by pairs
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 6June 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 1689

(XIR
2
, v IR
2
):

m(x,v,u)

2
IP(P(u) =move,X(u) x,V(u) V)
xv


Let p(x, u) be the pdf at time u over the state space x
for the node in the pause phase

p(x,u)
IP(P(u) =pause,X(u) v)
xv


We assume that move and pause phases are
exponentially distributed with parameters and ,
respectively, and that at the opening of each move
phase a node selects a speed from the generic
distribution f(v), with the arbitrary speed value being
upper bounded by a constant V
max
a logical
assumption. The evolution over a general state space
can be described, similarly by a set of dynamical
equations associating the probability distribution
functions at distinct time instants. For the RD model,
equations in differential forms have been first
incurred in being v.

m(x,,u)
u
=:. m(x,v,u) (1)
+f (v)p(X) m(x,v,u),

p(x,u)
u
=zp(x,u) + zm(x,:,u)J:, (2)


m(x,:,u) The inner product between v
and m(x,:,u , which is the gradient of
m(x,:,u)with respect to x.At any time, we apply a
double Fourier transform over the space coordinates
and a unilateral Laplace transform over time. We
obtain
sm(k,:,s) m(k,:) =:.]km(k,:,s) (3)
+ z(:)p(k) m(k,:,s)

sp(k,s) p
0
(k,:) =
zp(k,u) +m(k,:,s)J: (4)


Where
m(k,:,s) =__m(x,:,u)c
-su-]k.x
ouox,

p(k,s) =__p(x,u) c
-]k.x
ouox,

m
0
(k,:) =m(x,:,0)c
-]k.x
ox ,

p
o
(k) =_p(x,0)c
-]k.x
ox.

After some calculations, defining

H(k,s) =m(k,:,s)J:,

We have

H(k,s) =

Z]()p
0
(k)
(s+Z)(s++]k.)
+
m
0
(k,)
s++]k.

1-
Z]()
(s+Z)(s++]k.)

(5)
And

p(k,s) =
M(k,s)+p
0
(k)
s+x
(6)


Unfortunately, we were unable to analytical invert
the transform in (5); moreover, some care is
necessary to numerically invert the transforms in (5)
and (6) due to the presence of a singularity in the
origin. However, by manipulating (5) and (6), it is
possible to get a distinct expression for the
transforms in terms of move-pause cycles that can
easily be numerically turned Furthermore, closed-
form expressions for the temporal evolution of the
moments of the node spatial distribution can be
incurred. Let Y
l
(u) be the l
th
central moment of the
node position distribution at time u irrespective of the
phase, and let Y
l
(s) be its Laplace transform. We
have

I
(u) = [
x

(x

)
I
m(x,:,u)o:ox +
2
=1
(x

)
I
p(x,u)ox],

I
(s) =]
I

o
I
o
I
k

[H(k,s) +p(k,s)]|
k=0
.
2
=1


Since
I
(s) is a rational expression in s. In particular,
we report here the formula for the variance, which
will be of essential importance to derive the
estimation for the probability of link accessibility.
The formula is deduced assuming that the node starts
at u=0 in steady-state conditions
In steady-state conditions, If (p (0) =move) =
\
\+
and
the node speed distribution is equal to f (v)
Expressions corresponding to (7) can be incurred for
distinct initial conditions.

International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 6June 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 1690


Fig. 1. Variance of the spatial distribution of node,
when the node starts at u=0 in x=0. The values of
and are explicit in s
-1
, while the variance values are
explicit in m
2
.

o
2
(u) =
2
(t) =2
\c
2

2
(+\)
(u +c
-t
1), (7)

Where o
2
is the variance of the node speed
distribution f (v) .The variance as a function of time
and for distinct values of = (i.e., equal average
duration of the move and pause phases) is shown in
Fig. 1, for o
2
=1m
2
/s. Notice that as time increases,
all curves in the plot tends to show a linear behavior
with t, since in (7) u becomes the dominant term.
For long durations of the move and pause phases i.e.,
for small values of =, the variance increases and
the linear behavior appears for larger values of u.

4.2 Link Accessibility
We can write a precise expression for the probability
of link accessibility at time u, by using the spatial pdf
of nodes moving accordant to the RD model.
Consider nodes A and B, let M
A
(x, u) =m
A
(x, v,
u)o: and p
B
(x, u) be the spatial distributions of A at
time u in the move and pause phases, and let M
B
(x, u)
= m
B
(x, v, u) o: and p
B
(x, u) be the spatial
distributions of B at time u in the move and pause
phases. The probability of link accessibility between
the two nodes can be explicit as

A
Ink
(J
A,B
(0),u) =

X
B
[H
A
(x
A
,u) +p
A
(x
A
,u)].[H
B
(x
B
,u) +p
B
(x
B
,u)]
(8)

Which stems directly from the above expression can
be numerically evaluated; however the solution is
computationally intensive? Indeed, it requires first to
numerically evaluate the spatial distribution of nodes
A and B at time u through a tridimensional inverse
transform two spatial dimensions and one temporary
dimension, then to numerically calculate the integral
in (8) over a four-dimensional domain. For all those
reasons, we suggest a close methodology for the
evaluation of A
Ink
(J
A,B
(0),u) , which relies on
estimating the spatial distribution of each node at
time u with a normal distribution having the same
mean and variance. This estimation is justified by the
fact that at time u, the total movement of a node with
respect to its initial position is essentially find by the
vectorial sum of the elementary movements affiliated
to attained move phases. Elementary movements
being independent and identically distributed, the
central limit theorem can be invoked to claim that the
marginal spatial distribution of the nodes tends to be
a normal distribution for sufficiently large u.
As an example, in Fig. 2 we show the numerical
inverse transform of M(k, s) in (5), in case of a one-
dimensional RD model in which move and pause
times have an average of 5 s while the speed is
uniformly distributed in [-2,2]m/s. The plot presents
on a log scale the spatial distribution M(x, u) in the
move phase of a node, which starts at time u=0 in
x=0 in the pause phase. The node spatial distribution
is sampled every 10 s, i.e., the average duration of a
cycle including one move phase and one pause phase.
We observe that after a few cycles, the node spatial
distribution takes a bell shape. On the same plot we
also reported, for t=100 s only, a normal distribution
having the same variance of the node spatial
distribution. We notice that after 10 cycles, the
normal estimation is indeed very good. Under the
suggested estimation, denoting by a normal
distribution with average and varianceo
2
, we have
that (8) becomes

A
Ink
(J
A,B
(0),u)

=
X
A

x
B
J(x
0
A
,o
2
(u),x
A
)J(x
0
B
,o
2
(u),x
B
)


=
x<R
J(x
0
A
x
0
B
,2o
2
(u),x)ox ... (13)


=
1
2c
2
(u)
c
p
2
+d
A,B
2
(0)
4o
2
(u)
I
0
[
pd
A,B
(0)
2c
2
(u)
p op,
R
0



where we exploited the fact that the relative position
of nodes A and B;X
A
(u) -X
B
(u), is still normally
distributed, being the individual position of nodes A
and B described by independent normal random
variables.
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 6June 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 1691


Fig.2. Node spatial distribution in the movephase sampled
at u=10, 20, 30100s


4.3 Duration of a Link
A precise expression for the link duration probability
under the RD model appears preventive for the
following reasons:
The relative motion between two nodes moving
accordant to independent RD motions is no longer an
RD motion. However, the dimensionality of the state
space increases since the instantaneous system state
is characterized by 1) the phases of the nodes
p
A
(u)p={move,pause} and p
B
(u)p={move,pause}
2) the instantaneous relative position X
A
(u)-X
B
(u);
and 3) the current speed of the two nodes V
A
(u)- and
V
B
(u).The prevailed equations should be solved over
a circular spatial domain of radius R, with absorbing
boundary conditions. However, the structure of the
equations distinguishing the relative motion becomes
much more complex when they are explicit in polar
coordinates, and any attempt to apply the
methodology of separation of variables fails. For
these reasons, some estimation is needed to evaluate
the link duration for the RD model. A rough
estimation could be to plug the instantaneous
variance of the node spatial distribution directly into
the expression of the link duration. Note that
although being a rough estimation, this is typical
second order estimation, i.e., an estimation that
matches the first two moments of the original random
process. Second order estimations have successfully
been applied in various contexts, such as in queuing
theory, where a queue workload is closed by a same
mean and variance. We observe that in contrast to the
link accessibility, the probability of link duration
decays exponentially as time goes to infinity. This is
because the dominant term in the link duration
becomesc
-(n)
2
c
2
u
.
5 Optimum Path Selections
In the following discussion, we assume that the
parameters of the underlying mobility model of the
nodes are given and that all nodes have a fixed,
common radio range R. To introduce the problem of
path selection, suppose node A wants to
communicate with node B (see Fig. 3), possibly using
intermediate nodes as relays.
Fig. 3. Path selection between nodes A and B.
To maximize the stability of the route in response to
node mobility, one can think of two distinct
strategies: 1) a few long hops and 2) many short
hops. On the one hand, considering that the entire
path fails if just a single link fails and that nodes
move independently of each other, it seems better to
minimize the number of hops. On the other hand,
short links are much more stable than long links (see
Fig. 3). These simple considerations suggest that
there could be an optimum choice in between the
extreme solutions of using few long hops of length
close to the nodes radio range, or many short hops in
the limit, an infinite number of infinitesimal hops.
Let us assume, for simplicity, that the node density is
large enough that we can almost select any point in
the area to act as relay between nodes A and B.
Under this assumption, it is possible to show that the
above hunch is correct: B or a given source-
destination pair, there exists an optimum number of
hops to use, which depends, besides the distance
between the two end points, on the desired duration
of the path.
6 Conclusions
We studied the duration and accessibility
probabilities of routing paths in MANETS.
A Considerable issue to provide reliable routes and
short route commotion times. We convergent on the
Random Direction mobility model and deduced both
accurate and close but simple expressions for the
probability of path duration and accessibility. We
used these results to find the optimum path in terms
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 6June 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 1692

of route stability specifically we showed some
properties of the optimum path. Eventually, based on
our findings, we suggested an approach to find and
select routes, which accounts for the required data
transfer time over the path and allows reducing the
overhead of reactive routing protocols.
7 References
[1] R. Dube, C.D. Rais, K.-Y. Wang, and S.K.
Tripathi, Signal Stability Based Adaptive Routing
(SSA) for Ad-Hoc Mobile Networks, IEEE Personal
Comm., vol. 4, no. 1, pp. 36-45, Feb. 1997.
[2] S. Agarwal, A. Ahuja, J .P. Singh, and R. Shorey,
Route-Lifetime Assessment Based Routing (RABR)
Protocol for Mobile Ad-Hoc Networks, Proc. IEEE
Intl Conf. Comm. (ICC 00), pp. 1697-1701, J une
2000.
[3]W. Su, S.-J . Lee, and M. Gerla, Mobility
Prediction and Routing in Ad Hoc Wireless
Networks, Intl J . Network Management, vol. 11,
no. 1, pp. 3-30, J an./Feb. 2001.
[4] C. Bettstetter, G. Resta, and P. Santi, The Node
Distribution of the Random Waypoint Mobility
Model for Wireless Ad Hoc Networks, IEEE Trans.
Mobile Computing, vol. 2, no. 3, pp. 257-269, J uly-
Sept. 2003.
[5] T. Camp, J. Boleng, and V. Davies, A Survey of
Mobility Models for Ad Hoc Network Research,
Wireless Comm. & Mobile Computing (WCMC 02),
special issue on mobile ad hoc networking: research,
trends, and applications, vol. 2, no. 5, pp. 483-502,
2002.
[6] P. Nain, D. Towsley, B. Liu, and Z. Liu,
Properties of Random Direction Model, Proc. IEEE
INFOCOM, Mar. 2005.
[7] E.M. Royer, P.M. Melliar, and L.E. Moser-Smith,
An Analysis of the Optimum Node Density for Ad
hoc Mobile Networks, Proc. IEEE Intl Conf.
Comm. (ICC 01), June 2001.
[8] V. Rodoplu and T.H. Meng, Minimum Energy
Mobile Wireless Networks, IEEE J. Selected Areas
in Comm., vol. 17, no. 8, pp. 1333- 1344, Aug. 1999.
[9] C.E. Jones, K.M. Siva lingam, P. Agrawal, and
J .C. Chen, A Survey of Energy Efficient Network
Protocols for Wireless Networks, Wireless
Networks, vol. 7, no. 4, pp. 343-358, J uly 2001.
[10] G. Zussman and A. Segall, Energy Efficient
Routing in Ad Hoc Disaster Recovery Networks,
Proc. IEEE INFOCOM, Apr. 2003.
Authors:
Mr.I.S.Raghuram received his M.Tech degree in
Computer Science and Engineering from J NTU,
India. He was a Lecture, Assistant Professor with
Department of CSE. His research interests include
Data Mining, Ad-hoc Networks, and Sensor
Networks, Mobile Computing.

Mr.B.Hari Santhosh Rao received his B.Tech degree
in Computer Science Engineering from J NTU, India.

Mr.M.Gunasekhar received his B.Tech degree in
Computer Science Engineering from J NTU, India.

Miss.G.Geetha Lakshmi received his B.Tech degree
in Computer Science Engineering from J NTU, India.