(IJCNS) International Journal of Computer and Network Security, 183

Vol. 2, No. 10, 2010

Node Realization: Proposed techniques of random

walk, statistical and clustering
A.Kumar1, P.Chakrabarti2 and P.Saini3
1
Dept. of Comp. Sci. & Engg., Sir Padampat Singhania University,
Udaipur-313601,Rajasthan, India
1
arunkumarsai@gmail.com
2
Dept. of Comp. Sci. & Engg., Sir Padampat Singhania University,
Udaipur-313601,Rajasthan, India
2
prasun9999@rediffmail.com
3
Dept. of Comp. Sci. & Engg., Sir Padampat Singhania University,
Udaipur-313601,Rajasthan, India
3
poonam.saini9@gmail.com

• The distance from one point in the path to the next

Abstract: The paper deals with positional node detection on the
basis of random walk motion. The concept of curve fitting has
been applied for random walk observation in n-dimension. The
paper also points out the research issues of node inspection
using statistical approaches. Nodal communication strategies in
cluster based network structures have also been studied. The
related graphical representation has been cited with proper
justification.
Keyword:Node, Random walk, curve fitting, statistical
approaches, cluster
1. Introduction
The random walk model concept dates back to the irregular
motion of individual pollen grains experimented by Robert
Brown (1828), [1],[2],[3] and now it is called Brownian
Motion. Brownian Motion in two dimensions
Brownian motion, in some systems can also be described as
noise, and is a continuous motion of small particles. The
striking features of this concept are:
• The motion is very irregular, composed of
translations and rotations, and the trajectory of the
motion appears to have no tangent.
• Two particles appear to move independently, even
when they approach one another, within a distance
less than their diameter.
• The smaller is the particle; the more active is the
motion.
• The composition and density of the particles have no
effect.
• The less viscous is the fluid; the more active is the
motion.
• The higher is the temperature; the more active is the
motion.
• The motion never ceases.
In a simple random walk model for node moving in a
mobile adhoc network, the following assumptions are
considered -
• There is a starting point.
is constant
• The direction from one point in the path to the next
is chosen at random, and no direction is more
probable than another.
Consider a node moving on an infinite, one dimensional
uniform line .Let the node start its journey at the origin (
x=0) and then it moves a small distance δ either left or right
in a short time τ . The motion is completely random and the
probabilities of moving both left and right is 1/2 .The can be
either at left or right of the origin and the distance is as
assumed earlier i.e. δ. The next time step the node will be at
a position 2δ to the left or right of the origin with
probability of 1/4 each or even the node can return to its
original position.On assuming the above behavior of the
node, the probability that the node will be at a distance mδto
the right direction of the origin or to the left direction of the
origin after taking n time steps and can be represented as a
binomial distribution with mean 0 and variance n. The
mean location for one dimension is zero and the mean
squared displacement is equal to 2Dt.Therefore we conclude
that when direction bias is missing,there is no overall
movement in any direction. The graphical representations
of Random Walk Motion in n-dimension[4]i.e. for 1D, 2D
and 3D have been shown in figures 1, 2, 3.
Figure 1. Random Walk Motion in 1D
184 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 10, 2010
Here , and are the coefficients and x and y are the
coordinate values for the mobile node,and e is the error
value.
(5)
Taking differentiation of the above equation, we get
(6)
(7)
(8)
Rearranging the above equations, we get,
(9)
(10)
(11)
In general we can write:
(12)
Figure 2. Random Walk Motion in 2D (13)
Here refers to the standard error of the estimate, y/x
indicates that the error is for predicted value of y
corresponding to the value of x. The Figure1 shows the
quadratic equation fitting curve for a data for the nodes , for
a least square parabola. In figure 4, we observe that the
nodes are scattered throughout the network, but least square
method as shown in figure 5 for a line will not fit the data
plotted. We, then use the least square parabola as shown in
figure 6, to fit the data about the nodes scattered in a
network.

Figure 3. Random Walk Motion in 3D

2. Proposed Node Realization using Curve
Fitting
Since mobile nodes are spread throughout the network, and Figure 4. Data points plotted and failure of the least
every node will have an independent coordinate position, a Square fit line to cover all the points.
mathematical procedure for finding the best fitting curve to
a given set of points is by minimizing the sum of the squares
of the offset points from the curve. We need to derive an
approximate function that fits the data.
It is to use the curve that minimizes the discrepancy between
the data points and the curve. Therefore, let us first quantify
the discrepancy. Therefore we will fit a straight line to a set
of paired observations .
The mathematical expression of the straight line is Figure 5. Least square parabola
(1)
where, and are intercept and slope of the line; here,
e refers to error between model and observation, which is
represented as:
(2)
The best fit line through the data would minimize the sum
of the residual errors for all the data.
(3)
Since it is not necessary that the nodes may fit in a straight
line, therefore the nodes by default are scattered throughout
the network.
If we extend the least square procedure to fit the higher
order polynomial, it is called polynomial regression, e.g. 2nd Figure 6. Parabola covering all the points scattered
order polynomial or quadratic.
+e (4)
 (IJCNS) International Journal of Computer and Network Security, 185
Vol. 2, No. 10, 2010
3. Statistical Relation Based Node Sensation
3.1 Quadrant Based Classification

We consider the nodal positions respective to the timing

instants t1, t2, ……tn as (x1, y1), (x2, y2),……, (xn, yn)
respectively. We propose a technique of central point
selection and then realizing the existence of nodes in virtual
Now let us consider the case when there is only one element
quadrants. The density of quadrants is estimated and the i.e. 1*1.In this particular case, if we want to communicate
most one is selected as the area of observation. between the farthest nodes, then there will be only one node
in between the source and the destination which can be
Issue 1: If the nodes are more or less equally distributed in further visualized as follows:
all the quadrants, in that case the origin(0,0) will be the
center and based on that an imaginary circle will be drawn
whose radius r will be equal to

3.2. Relation Based Classification

If we denote it by using the function f(x), then the value of
Issue 2: Node trace can be facilitated, if there exists any f(x)will be 1.f(x) =1,the intermediate node is II.
relation between co-ordinates of the nodes[5]. Now, let us consider the case 2*2 matrix, the value here will
bef(x)=1+2=3; The intermediate nodes are 1(2,3),2(4,3).
Justification:We assume that the nodes N1(x1, y1), N2(x2,
y2),……,Nn(xn, yn) are the observed nodes such
That for each node yi=cxi, (1≤i≤n) and c is constant.
The representation is shown in table 1 which is as follows:

Table 1: Nodes and respective co-ordinate representation

Nodes xi yi =c xi For the case for the 3*3 matrix, the value of the function
N1 x1 y1 =c x1 f(x)=1+2+2=5;
N2 x2 y2 =c x2
….. …… …………
Nn xn yn =c xn

c x1).( c x2)………… (cxn) = cn

1/n
Therefore, (cn 1/n
=c( 1/n

Therefore, geometric mean of y co-ordinates is equal to the

product of the constant and geometric mean of x co-
ordinates.
4. Node Realization in Cluster Networks
This section mainly focuses on the nodal communication
between the farthest node in a N*N structure.Let us assume
each cluster to be consisting of 16 nodes and then try to
communicate between the source and the destination
node.The point to be noted here is that to establish the
communication link between the adjacent elements or units
of the cluster we have to have the communication in just
reverse order in the two adjacent elements.The order of the
communication is
The condition can be visually imagined as follows:
Similarly for the 4*4 matrix, we can get the value of
f(x)=1+2+2+2=7.
Here, in this case, we were having only 4 elements in a
ring.Suppose we have 8 elements in the ring, in that case,we
have to compute the number of nodes required to
communicate or to establish the connection between the
farthest nodes.
Justification:Let us consider the case of 1*1 matrix to
communicate between the farthest nodes, we need 3 nodes,
i.e. f(x)=3.In case of 2*2 matrix, to communicate between
the farthest nodes, we need 7 nodes, i.e. f(x)=3+4;In case of
3*3 matrix to communicate between the farthest nodes, we
need 7 nodes, i.e. f(x)=3+4+4;In case of 4*4 matrix, to
communicate between the farthest nodes, we need 7 nodes,
i.e. f(x)=3+4+4+4;In case of 16 elements in a ring, we can
proceed as follows:let us consider the case of 1*1 matrix to
communicate between the farthest nodes, we need 3 nodes,
i.e, f(x)=7.In case of 2*2 matrix to communicate between
the farthest nodes, we need 7 nodes, i.e. f(x)=7+8;In case of
3*3 matrix to communicate between the farthest nodes, we
186 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 10, 2010
need 7 nodes, i.e, f(x)=7+8+8;In case of 4*4 matrix, to [4] A.Kumar ,P.Chakrabarti , P.Saini , “Approach towards
communicate between the farthest nodes, we need 7 nodes, analyzing motion of mobile nodes- A survey and
i.e. f(x)=7+8+8+8;Now the total number of nodes can be graphical representation” published in International
derived by the general formula as (N/2-1)+(M-1)*(N/2), Journal of Computer Science and Information
where N is the number of nodes present in the unit or Security, IJCSIS , USA , Vol 8 No 1 , 2010, pp250-
element and M is the dimension of the square matrix.The 253
data can be represented in the tabular form as shown in [5] P.K.Giri ,J.Banerjee , Introduction to Statistics,
table 2. Academic Publishers , 2001
Table 2:Number of Nodes Corresponding to the matrix
No. of 1*1 2*2 3*3 4*4
nodes
4 1 3 5 7
8 3 7 11 15
16 7 15 23 31

The Graphical representation of nodal communication in

Cluster is shown in figure 7 where, the x-axis represents the
M*M matrix where M varies from 1 to 3.The y-axis
represents the number of optimum communication nodes
required in the establishing the path between the source
node and the farthest node. The number of nodes per
element is indicated by the 3colors.

Figure 7. Graphical representation of nodal communication

in
Cluster

5. Conclusion
The paper deals with random walk based node sensation. It
has been shown how based on dimension random walk
representation is varied. The paper also points out proposed
schemes of node realization on the basis of curve fitting and
statistical based approaches. Nodal communication between
the farthest nodes in a cluster based network structure has
also been studied with relevant graphical representation.
References
[1] Edward A. Coding, Michael J. Plank and Simon
Benhamou, “ Random walk models in biology”
published[online] in Journal of The Royal Society
Interface, 15 April, 2008.
[2] M. I. MohdSaad, Z. A. Zukarnain, “ Performance
Analysis of Random-Based Mobility Models in
MANET Routing Protocol” published in European
Journal of Scientific Research, Vol. 32 No 4(2009), pp
444-454.
[3] Christian Bettstetter, “Mobility modeling in wireless
networks: categorization smooth movement and border
effects” published in ACM SIGMOBILE mobile
computing and Communication review 2001.