Optimal Routing and Data Aggregation for Maximizing

Lifetime of Wireless Sensor Networks

Under the guidance of

M.Gnanavardhan

By
K.Siva krishnkanth (07471A0544)
G.Sindhu (07471A0516)
G.Sindhuja (07471A0514)
Ch.Ranjit Kumar (07471A0510)
 Abstract
An optimal routing and data aggregation scheme for wireless
sensor networks is proposed in this paper. The objective is to
maximize the network lifetime by jointly optimizing data
aggregation and routing. We adopt a model to integrate data
aggregation with the underlying routing scheme and present a
smoothing approximation function for the optimization
problem.. We show that the proposed scheme can significantly
reduce the data traffic and improve the network lifetime. The
distributed algorithm can converge to the optimal value
efficiently under all network configurations.
Existing System:
i)Redundant information can be removed through data
aggregation at the intermediate nodes. The drawback of this
approach is that it tends to overwhelm the nodes on the
minimum energy path, which is undesirable for sensor networks
since all sensor nodes are collaborating for a common mission
and the duties of failed nodes may not be taken by other nodes.
ii)A few schemes have been proposed to address this
problem by studying the maximum lifetime routing
problem. The problem focuses on computing the flow
and transmission power to maximize the lifetime of the
network, which is the time at which the first node in
the network runs out of energy. The common
assumption of these works is that the data flows are
conserved during the transmission from the sensor
nodes to the sink node, which however is not true for
sensor networks because data collected by neighboring
nodes are often spatially correlated.
 Proposed System:
By jointly optimizing routing and data aggregation, the network
lifetime can be extended from two dimensions:
i)One is to reduce the traffic across the network by data
aggregation.
ii) The other is to balance the traffic to avoid overwhelming the
bottleneck nodes. We adopt the geometric routing whereby the
routing is determined solely according to the nodal position.
Requirements:
Hardware Requirements:
Processor : Pentium III and Above
RAM : 256 MB
Hard Disk : 40 GB
Software Requirements:
Language : Java 1.4
Operating System : Windows 2000, XP
IDE : Swing Builder
Modules:
 Convergence of the Distributed Algorithm
 Routing Model
 Data Aggregation Model
 
1.Routing Model:
The routing algorithm suitable for use belongs to the class of
“geometric routing” algorithm. Every sensor node is assumed
to know its own position as well as that of its neighbors,
which can be obtained with some localization schemes. Each
node can forward packets to its neighbors within its
transmission range that are closer to the sink node than itself.
GEOMETRIC ROUTING RULE:

In geometric routing it consists of nodes with two

neighbors

i)Up Stream Neighbor.

ii)Down Stream Neighbor.
According to Geometric rule the outgoing
traffic from a node can only be forwarded towards
the sink node through a set of down stream
neighbors.
2.Data Aggregation Model:
A salient feature of sensor networks is that data collected by
the neighboring senor nodes may carry redundant information
due to the spatio-temporal correlation characteristics of the
physical medium being sensed such as the temperature and
humidity sensors in a similar geographic region or magneto
metric sensors tracking a moving vehicle. To remove the
redundant information and reduce the traffic, it is necessary to
aggregate the data at the intermediate nodes.We use a model
called “Foreign Coding model”
Foreign coding model:
In this a node perform two operations for data
received by its upstream neighbor:
i) For raw data generated by its upstream neighbor it
encodes the data.
ii) For transit data (already compressed data) it
directly forwards the packet to next hop.
3.Convergence of the Distributed Algorithm:
The aggregated data rate is normalized with respect to the
optimal value obtained by the centralized MLR algorithm.
Again, we see that the distributed MLR algorithm successfully
reduces the data rate and achieves closer approximation ratios
(below 105%) of the optimal results returned by the centralized
algorithm.
Usecase Diagram:
A use case diagram is a graph of actors, a set of use
cases enclosed by a system boundary, communication
(participation) associations between the actors and users
and generalization among use cases. The use case model
defines the outside (actors) and inside (use case) of the
system’s behavior.
 Enter the Distance

Neighbor Discovery

Enter the Destination

Source Find All Paths

Destination
Select Path Flexibility

Enter the Data

Send Data

ACK
Conclusion:
By exploiting the special structure of the sensor network,
proposed a smoothing approximate function to overcome the non
differentiability of original optimization problem so that the
distributed solution is possible. The optimality conditions are
derived and a distributed algorithm is designed accordingly
QUERIES?
THANK YOU