1. The document proposes localized, self-organizing, and energy-efficient data aggregation tree approaches called Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs) for sensor networks. 2. L-PEDAPs are based on topologies like LMST and RNG that can approximate a minimum spanning tree using only local neighbor information. The routing tree is constructed over these topologies. 3. Route maintenance procedures are included to handle node failures or additions while prioritizing remaining power levels to maximize network lifetime. Simulation results show L-PEDAPs perform nearly as well as centralized solutions for network lifetime.

1. Ambitlick Solutions
Computing Localized Power-Efficient Data Aggregation Trees
For Sensor Networks
Abstract:
We propose localized, self organizing, robust, and energy-efficient data
aggregation tree approaches for sensor networks, which we call Localized Power-
Efficient Data Aggregation Protocols (L-PEDAPs). They are based on topologies,
such as LMST and RNG, that can approximate minimum spanning tree and can be
efficiently computed using only position or distance information of one-hop
neighbors. The actual routing tree is constructed over these topologies. We also
consider different parent selection strategies while constructing a routing tree. We
compare each topology and parent selection strategy and conclude that the best
among them is the shortest path strategy over LMST structure. Our solution also
involves route maintenance procedures that will be executed when a sensor node
fails or a new node is added to the network. The proposed solution is also adapted
to consider the remaining power levels of nodes in order to increase the network
lifetime. Our simulation results show that by using our power-aware localized
approach, we can almost have the same performance of a centralized solution in
terms of network lifetime, and close to 90 percent of an upper bound derived here.

2. Ambitlick Solutions
SYSTEM ANALYSES :
Problem Definition:
The problem is to find an energy-efficient routing plan which maximizes the
network lifetime. The routing plan determines for each node the incoming and
outgoing neighbors for data forwarding and aggregation. In other words, a tree
spanning all the nodes must be found as the routing plan. The routing scheme
should also include mechanisms to handle node failures and support new node
arrivals.
Existing System:
The minimum spanning tree (MST)-based routing provides good
performance in terms of lifetime when the data are gathered using aggregation in
centralized manner alone.
Proposed System:
1. Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs)
2. The routing tree is constructed over LMST and RNG topologies.
3. Route maintenance.
4. Data aggregation protocol (LEACH protocol-Self-configuring Clusters)
5. To minimize Setup cost and maintenance cost

3. Ambitlick Solutions
Literature Review:
1. A QoS Routing for Maximum Bandwidth in Ad Hoc Networks:
Ad hoc networks have characteristics such as flexibility, fast and easy
deployment, robustness which make them an interesting technology for various
applications. Ad hoc networks are considered as the most promising terminal
networks in future mobile communications. Providing sufficient bandwidth for
multimedia applications in ad hoc networks is an urgent task because of the rising
popularity of multimedia applications and potential commercial usage of ad hoc
networks. Bandwidth is more difficult to guarantee in ad hoc networks than in
other types of networks, and providing end-to-end bandwidth guarantee is a critical
and challenging problem in ad hoc networks because of multihop, mutual radio
interference and node mobility. A bandwidth-aware routing protocol of BARP,
which is based on the existing Dynamic Source Routing protocol (DSR), is
proposed in this paper in order to find a route of approximately maximum
bandwidth for a flow from a source node to a destination node in a wireless ad hoc
network. BARP is a novel bandwidth-aware routing protocol by which a route of
largest bandwidth can be found. This routing protocol takes advantage of larger
bandwidth than the existing work, and its effectiveness is demonstrated by some

4. Ambitlick Solutions
simulations. It will be a great contribution to end-to-end QoS support research in
wireless ad hoc networks.
2. Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks:
Energy efficiency is an important design criterion for the development of
sensor networking protocols involving data dissemination and gathering. In-
network processing of sensor data, aggregation, transmission power control in
radios, and periodic cycling of node wake-up schedules are some techniques that
have been proposed in the sensor networking literature for achieving energy
efficiency. Owing to the broadcast nature of the wireless channel many nodes in
the vicinity of a sender node may overhear its packet transmissions even if they are
not the intended recipients of these transmissions. Reception of these transmissions
can result in unnecessary expenditure of battery energy of the recipients. We
investigate the impact of overhearing transmissions on total energy costs during
data gathering and dissemination and attempt to minimize them systematically. We
model the minimum energy data gathering problem as a directed minimum energy
spanning tree problem where the energy cost of each edge in the wireless
connectivity graph is augmented by the overhearing cost of the corresponding
transmission. We observe that in dense sensor networks, overhearing costs

5. Ambitlick Solutions
constitute a significant fraction of the total energy cost and that computing the
minimum spanning tree on the augmented cost metric results in energy savings,
especially in networks with non-uniform spatial node distribution. We also study
the impact of this new metric on the well known energy-efficient dissemination
(also called broadcasting) algorithms for multihop wireless networks. We show via
simulation that through this augmented cost metric, gains in energy efficiency of
10% or more are possible without additional hardware and minimal additional
complexity.
3. Establishment of survivable connections in WDM networks using partial path
protection:
As a generalization of the traditional path protection scheme in WDM
networks where a backup path is needed for each active path, the partial path
protection scheme uses a collection of backup paths to protect an active path,
where each backup path in the collection protects one or more links on the active
path such that every link on the active path is protected by one of the backup paths.
While there is no known polynomial time algorithm for computing an active path
and a corresponding backup path using the path protection scheme for a source-
destination node pair, we show that an active path and a corresponding collection

6. Ambitlick Solutions
of backup paths using the partial path protection scheme can be computed in
polynomial time, whenever they exist, under each of the following two network
models: (a) dedicated protection in WDM networks without wavelength
converters; and (b) shared protection in WDM networks without wavelength
converters. Under each of the two models, we prove, that for any given source s
and destination d in the network, if one candidate active path connecting s and d is
protectable using partial path protection, then any candidate active path connecting
s and d is also protectable using partial path protection. This fundamental property
leads to efficient shortest active path algorithms that can find an active path and its
corresponding partial path protections whenever they exist. Simulation results
show that shared partial path protection outperforms shared path protection in
terms of blocking probability.