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-hopneighbors. The actual routing tree is constructed over these topologies. We also consider different parent selection strategies whileconstructing a routing tree. We compare each topology and parent selection strategy and conclude that the best among them is theshortest path strategy over LMSTstructure. 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 inorder 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.

You are here: Home / IEEE 2011 PROJECTS / Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks