AN DECENTRALIZED FILE SHAREING &
DATA TRANSMISSION IN PEER TO PEER
COMMUNICATION USING EDONKEY
PROTOCOL
Abstract—The Mobile Agent based data gathering is the
advanced technique in the Wireless Sensor
Network(WSN).In this paper Distributed Optimal
movement Strategies process takes place .In this method
the mobile agents move around the sensor network in a
scheduling manner. The Mobile agent act as both the
Query collector/data collector. and returns the
information to the mobile server. Each sensor node is
equipped with limited buffer space .In order to reduce the
data loss in the sensor network Shortest Path Algorithm
is preferred. In this method all the Buffers in each sensor
nodes are grouped together and encoded at the
transmitter side .The Mobile Agent carries the data and
inform it to the receiver side,so that the original data can
be retrived after decoding .By doing this method the
delay is reduced with maximum cost saving.
Index Terms—Wireless sensor networks, data gathering,
Distributed optimal movement strategy ,Shortest Path
Algorithm.
I. INTRODUCTION
Data gathering or harvesting is a generic research
problem in wireless sensor networks (WSNs) –
how to collect observed (or measured) data or
information from sensor nodes. For the data
gathering process, a sink (or base station)
periodically generates query packets or data
packets to gather certain information of interest
from sensor nodes [2], [3], [4], [5], or each sensor,
instead, directly informs the sink node about its
observed data or events [3],[4]. In addition, mobile
sinks (agents), e.g., data mules, can move around
the sensor field and collect information observed at
each sensor node [2],[4]. A random walk has been
widely used as a means of randomized routing or
probabilistic packet forwarding in the data
gathering process leads to the preferable properties
such as simplicity of implementation, scalability,
robustness to topology changes, and avoiding
critical points of failure (or hot-spot formation) [2],
[3]. The random walk has been also popularly used
as a mobility pattern for physical mobile agents
collecting information over sensor nodes [1]. As to
the random walk-based routing for data gathering,
the existing research studies have mainly focused
on the performance of the following metrics: delay
– the time for a random walk (a data or query
packet) to reach its destination. These metrics are
suitable for one shot information delivery or
search/query. In contrast, the problem of data
gathering using the random-walk agents is the
important perspective. WSNs are composed of
low-cost, low-power sensors, each of which is
equipped with limited buffer/storage space for data.
Also, the random walk-based data gathering is
typically for delay insensitive applications in which
the collected data is mainly used for post-
processing or other research studies later. It is thus
more important to measure how much data can be
collected before it is lost due to limited buffer
space, when the sink periodically generates query
packets or collector packets moving over the
network in a random walk fashion to gather
measured data or its aggregated/compressed
version from sensor nodes [2], [3], [4].
There is another set of research work on exploiting
physical mobile agents (e.g., data mules) for data
harvesting over the sensor field [1],[3],[4]. rather
than relying on multi-hop communication over
sensor nodes. The reason of using the mobile
agents is to save the limited battery power of each
sensor and to overcome possible network isolation.
II. EXISTING WORK
DISTRIBUTED OPTIMAL MOVEMENT
STRATEGIES.
In this method the mobile agent moves around the
sensor networks in scheduling manner. Each sensor
node contain its limited buffer size. After the buffer
has filled the sensor node gives the request (ie) the
buffer has filled the total memory to the mobile
agent .After accepting the request the mobile agent
travels around the relevant node and it carries the
information from that sensor node and inform it to
sink node about the observed data .Instead the
buffer got lost the network fails to perform the
operation which leads to gradual increase in the
delay in the network. so the Shortest Path
Algorithm based algorithm were adopted in
wireless sensor network.
 III. PROPOSED WORK
A.SHORTEST PATH ALGORITHM
In Shortest Path Algorithm a set of buffers are
grouped together and encoding at the transmitter
side. The encoding process takes place by EX-OR
operation. The buffer data contents such as
001,010,110etc are encoded which results after EX-
OR operation as 101.is carried by the mobile agent
to the sink node.so that the original data that is
transmitted is retrived after decoding process.by
following this method the delay will be minimized
2times greater than tat of the Distributed optimal
movement strategy method of data gathering in the
Wireless sensor Networks(WSN).
Fig. 1. Illustrating our system model in which each sensor has
limited buffer space and data arrival rate to each node is
heterogeneous, while a mobile collector, which can be either a
query/collector packet or a physical mobile agent, moves over
the graph to collect the data.
IV. SYSTEM MODEL
There are a set of sensor nodes N = {1,2,...,n} and
one mobile collector (or possibly, multiple mobile
collectors) for data gathering in the network. We
consider a discrete-time system (t = 0,1,2,...) with
each slot of unit length. Each sensor node i ∈ N
monitors its local area, observes events, which
belong to a certain phenomenon of interest, and
stores the observed events in its buffer size
B=O(1). We assume that such an event (or a piece
of data) arrives to each node i with some
probability pi∈(0,1) at time slot t and the data
arrivals are independent over i and t. Also, when
new data is collected and the buffer is full, the
oldest data is deleted to store the new. In other
words, the buffer management is done in a FIFO
fashion. Consider a connected, undirected graph G
= (N,E), where N is a set of vertexes (sensor nodes)
and E is a set of edges. The mobile collector
moving over G can be a collector packet or an
actual physical mobile agent. So, the existence of
an edge between nodes i,j can be different for each
case. In the former, we say that if sensor node i ∈ N
can reliably communicate with other sensor node j
∈N (i6= j), then there exists an edge between nodes
i,j, i.e., (i,j) ∈E. In this setup, the collector packet at
current node is moves to one of its neighbours at
next time slot.
E{[Yi-1]+}=∑∞𝑘=1(k − 1) + p{Yi = k} ---- (1)
From eqn. 1, we have
0
𝑃{𝑌𝑖 = 0} = E {P {Yi = }} = E{(1 − pi)Ri --- (2)
Ri
Where the last equality is from P{Ai(t)=0}=1-pi
and the independence of Ai(t) and Ri
PL can be written as,
𝑛
1 1 π2
i
PL=1 − + ∑ ---- (3)
𝑛𝑝 𝑛𝑝 πi+θ
i
𝑖=1
Now, PL is solely dependent on 𝜋𝑖 and the problem
of finding the optimal transition matrix P is
equivalent to finding the transition matrix P to
minimize PL.
V. SHORTEST PATH ALGORITHM
STRATEGY.
In this section, we formally define the optimization
problem in order to find the movement strategy of
the mobile collector (random walk) in minimizing
the network loss probability PL, and then explain
how the mobile collector can adjust its movement
strategy to achieve the optimal strategy in a
distributed manner. In our scenarios, sensors are
low-cost, low-power devices, each of which is
equipped with very small amount of storage space
available for data.
VI. NUMERICAL SIMULATIONS
In this section, we present simulation results on the
network loss probabilities of our distributed
optimal movement strategy under various setting of
buffer sizes and the number of mobile agents as
well as different data arrival patterns to the
network. In particular, we here demonstrate its
considerable performance improvement over the
standard random walk strategy in which a random
walk at the current node moves to any one of its
destination nodes. In all these simulations, we
observe that the network loss probability under our
Shortest Path Algorithm is about 2 times smaller
than that of the Distributed optimal Movement
Strategy. Note that the network loss probabilities
for both the standard random walk strategy and
Shortest Path Algorithm strategy tend to increase
with a larger number of sensor nodes (n = 200),
since the number of sensor nodes to be covered by
a mobile collector itself increases. The amount of
reduction in the network loss probability that we
achieve from Shortest Path Algorithm strategy (in
comparison with the standard random walk
strategy).is much greater than the existing one. For
each arrival pattern (or each simulation figure), the
data points are obtained by taking the average of
the results under 30 different heterogeneous and
spatially-correlated data arrival patterns. We expect
that our reasoning behind the Shortest Path
Algorithm strategy can be applicable for the design
of Markovian random walk-based applications
sample topologies of each sensor nodes. In all these
simulations, we observe that the network loss
probability under our Shortest Path Algorithm is
about 2 times smaller than that of the Distributed
optimal Movement Strategy . model. In all cases,
our coding strategy is consistently better than the
standard random walk strategy, and the ratio tends
to decrease ,implying that our strategy is
increasingly more advantageous as the buffer size.
Fig 1- Energy efficiency
Represents the energy efficiency with respect to
energy and time From this assesment the utilization of energy is
decreased in Shortest Path Algorithm process as shown in
figure.
Fig 2-Delivery ratio
Represents the delivery ratio with respect to time and
no of data packets. From this assessment no of delivery packets
is increased compared to the distributed optimal movement
strategy.
Fig 3 – Average signalling overhead
Represents the average signalling overhead with
respect to time and no of nodes.From this assessment signalling
covered over the entire network is comparably high than the
existing work.
Fig 4-Number of Drop Packets
Represents the no of live drops with respect to time
and no of nodes.from this simulation assessment the maximum
node covers the network .
VII. CONCLUSION
We have developed an simulated framework to
evaluate the network loss probability as a
performance metric for different distributed
optimal movement strategies of mobile collectors
moving over a graph (or network) for data
harvesting in WSNs. Under this framework, we
were able to find the Shortest Path Algorithm
strategy for the mobile collectors under mild
conditions so as to minimize the network loss
probability. Our optimal movement strategy can be
made distributed using only local information via
the Metropolis-Hastings algorithm. We have
demonstrated through extensive numerical
simulations that our Shortest Path Algorithm
strategy remarkably outperforms the Distributed
optimal movement strategy under various settings
of network topology, buffer size, and the number of
mobile collectors, as well as heterogeneous and
spatially-correlated data arrival patterns. We expect
that our reasoning behind the Shortest Path
Algorithm strategy can be applicable for the design
of Markovian random walkbased applications
sample topologies of each sensor node.
 VIII. References
[1] C.-H. Lee and D. Y. Eun, “Toward distributed optimal
movement strategy for data harvesting in wireless sensor
networks,” in IEEE
SECON, Seoul, South Korea, June 2012.
[2] S. Shakkottai, “Asymptotics of query strategies over a sensor
network,” in IEEE INFOCOM, Hong Kong SAR, China, March
2004.
[3] C. Avin and C. Brito, “Efficient and robust query processing
in dynamic environments using random walk techniques,” in
ACM/IEEE IPSN, Berkeley, CA, April 2004.
[4] C. Avin and B. Krishnamachari, “The power of choice in
randomwalks: an emprical study,” in ACM MSWiM,
Torremolinos, Spain,Oct. 2006.es.