ε-approximate spatial-window aggregation algorithm in wireless sensor networks
An efficient ε-approximate spatial-window aggregate query processing technique was proposed to approximate aggregate values over arbitrary regions with arbitrary accuracy.A dynamic programming algorithm was devised to compute minimum number of data to refine approximate summation to reach arbitrary...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)02-0099-11/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | An efficient ε-approximate spatial-window aggregate query processing technique was proposed to approximate aggregate values over arbitrary regions with arbitrary accuracy.A dynamic programming algorithm was devised to compute minimum number of data to refine approximate summation to reach arbitrary accuracy.The proposed algorithm was efficient to compute minimum/maximum values by only transmitting values promising to be in the exact results in order to reduce energy consumption.The experiment using real-world data demonstrates that the algorithms provide high quality results in arbitrary region and reach arbitrary accuracy with low energy cost. |
|---|---|
| ISSN: | 1000-436X |