Data aggregation for range query in wireless sensor networks

This work proposes efficient data aggregation algorithms based on a virtual grid for range query in wireless sensor networks. A sensor node is selected to be a manager, called head, in each grid. The responsibilities of head are to detect generated event, announce to all other heads, and respond to a moving user. A user obtains the occurred event information from its grid head. If a user is interested in an event, it issues a query to acquire data from a specified regular-shape or spreading irregular-shape ranges. Users can oversee the spreading event via querying the incurred irregular-shape range. In addition, this work proposes efficient approaches to gather data from sensor networks while voids exist. Finally, experimental results show that the proposed approaches are more energy-efficiency than the existing approach.