Aggregate Queries in Wireless Sensor Networks

Abstract EN

Recently as efficient processing of aggregate queries for fetching desired data from sensors has been recognized as a crucial part, in-network aggregate query processing techniques are studied intensively in wireless sensor networks.

Existing representative in-network aggregate query processing techniques propose routing algorithms and data structures for processing aggregate queries.

However, these aggregate query processing techniques have problems such as high energy consumption in sensor nodes, low accuracy of query processing results, and long query processing time.

In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation (BPA).

BPA divides a query region into several cells according to the distribution of sensor nodes and builds a quadtree, and then processes aggregate queries in parallel for each cell region according to routing.

It sends data in duplicate by removing redundant data, which, in turn, enhances the accuracy of query processing results.

Also, BPA uses a bucket-based data structure in aggregate query processing, and divides and conquers the bucket data structure adaptively according to the number of data in the bucket.

In addition, BPA compresses data in order to reduce the size of data in the bucket and performs data transmission filtering when each sensor node sends data.

Finally, in this paper, we prove its superiority through various experiments using sensor data.