Aggregation tree construction in sensor networks

Large-scale wireless sensor networks are expected to play an increasingly important role in future civilian and military settings. Collaborative microsensors could be very effective in monitoring their operations. However, low power and in-network data processing make data-centric routing in wireless sensor networks a challenging problem. In this paper we propose heuristics to construct and maintain an aggregation tree in sensor networks. This aggregation tree can be used to facilitate data-centric routing. The main idea is to turn off the radio of all leaf nodes to save power, and thereby extending the network lifetime. Therefore, in order to save the number of broadcasting messages, only the non-leaf nodes in the tree are in charge of data aggregation and traffic relaying. In this paper, we propose an efficient energy-aware distributed heuristic to generate the aggregation tree, which we refer to as EADAT. Our EADAT algorithm makes no assumption on local network topology, and is based on residual power. It makes use of neighboring broadcast scheduling and distributed competition among neighbors. These novel concepts make EADAT very efficient and effective, as demonstrated by our simulation experiments with NS2.