Computing localized power - efficient data aggregation trees for sensor networks
Tan, H. O.
IEEE Transactions on Parallel and Distributed Systems
Institute of Electrical and Electronics Engineers
489 - 500
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/22000
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 canbeefficiently computed using only position or distance information ofone-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 beexecuted whenasensor node fails ora new node is added to the network. The proposed solution is also adapted to consider the remaining power levels ofnodes in orderto increase the network lifetime. Our simulation results show that byusing 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. © 2011 IEEE.