Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks

Authors:
Huseyin Ozgur Tan;Ibrahim Korpeoglu;Ivan Stojmenovi_
Affiliations:
Bilkent University, Ankara;Bilkent University, Ankara;University of Ottawa, Ottawa
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2011

Citing 0
Cited 9

Energy-efficient routing for correlated data in wireless sensor networks

Ad Hoc Networks
Delay-bounded and energy-efficient data aggregation

Wireless Communications & Mobile Computing
Energy efficient ant colony algorithms for data aggregation in wireless sensor networks

Journal of Computer and System Sciences
A cross-layer framework for optimal delay-margin, network lifetime and utility tradeoff in wireless visual sensor networks

Ad Hoc Networks
Active node determination for correlated data gathering in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Dropping False Packet to Increase the Network Lifetime of Wireless Sensor Network using EFDD Protocol

Wireless Personal Communications: An International Journal
Wheel Based Event Triggered Data Aggregation and Routing in Wireless Sensor Networks: Agent Based Approach

Wireless Personal Communications: An International Journal
Optimistic Selection of Cluster Heads Based on Facility Location Problem in Cluster-Based Routing Protocols

Wireless Personal Communications: An International Journal
EGF-tree: an energy-efficient index tree for facilitating multi-region query aggregation in the internet of things

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

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.