Aggregate Queries in Wireless Sensor Networks
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 tech...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-09-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2012/625798 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547834934591488 |
|---|---|
| author | Jeong-Joon Kim In-Su Shin Yan-Sheng Zhang Dong-Oh Kim Ki-Joon Han |
| author_facet | Jeong-Joon Kim In-Su Shin Yan-Sheng Zhang Dong-Oh Kim Ki-Joon Han |
| author_sort | Jeong-Joon Kim |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-3d6027d3eb0f4f018f7eb5e445a838b3 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2012-09-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-3d6027d3eb0f4f018f7eb5e445a838b32025-02-03T06:43:07ZengWileyInternational Journal of Distributed Sensor Networks1550-14772012-09-01810.1155/2012/625798Aggregate Queries in Wireless Sensor NetworksJeong-Joon Kim0In-Su Shin1Yan-Sheng Zhang2Dong-Oh Kim3Ki-Joon Han4 Division of Computer Science & Engineering, Konkuk University, Seoul 143-701, Republic of Korea Division of Computer Science & Engineering, Konkuk University, Seoul 143-701, Republic of Korea Division of Software Engineering, Northeastern University, Shenyang 110819, China Cloud Computing Research Department, Electronics and Telecommunications Research Institute, Daejeon 305-700, Republic of Korea Division of Computer Science & Engineering, Konkuk University, Seoul 143-701, Republic of KoreaRecently 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.https://doi.org/10.1155/2012/625798 |
| spellingShingle | Jeong-Joon Kim In-Su Shin Yan-Sheng Zhang Dong-Oh Kim Ki-Joon Han Aggregate Queries in Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | Aggregate Queries in Wireless Sensor Networks |
| title_full | Aggregate Queries in Wireless Sensor Networks |
| title_fullStr | Aggregate Queries in Wireless Sensor Networks |
| title_full_unstemmed | Aggregate Queries in Wireless Sensor Networks |
| title_short | Aggregate Queries in Wireless Sensor Networks |
| title_sort | aggregate queries in wireless sensor networks |
| url | https://doi.org/10.1155/2012/625798 |
| work_keys_str_mv | AT jeongjoonkim aggregatequeriesinwirelesssensornetworks AT insushin aggregatequeriesinwirelesssensornetworks AT yanshengzhang aggregatequeriesinwirelesssensornetworks AT dongohkim aggregatequeriesinwirelesssensornetworks AT kijoonhan aggregatequeriesinwirelesssensornetworks |