Date Added: Aug 2009
Data aggregation is an efficient primitive in Wireless Sensor Network (WSN) applications, it can reduce the communication cost, thereby extending the lifetime of sensor networks. The goal of the authors work is to design techniques and algorithm that lead to efficient data aggregation without explicit maintenance of a structure. As packets need to converge spatially and temporally for data aggregation, an efficient approximation algorithm is proposed to achieve the following goals: monitoring data of any portion of the region can be obtained at one time by querying the root instead of flooding those regions, thus incurring significant energy savings. Using simulations experiments, the authors study the performance and potential of data aggregation.