ε-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: | Jing GAO, Jian-zhong LI, Yu LIU |
---|---|
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!
|
Similar Items
-
(ε,δ)-approximate counting algorithm for large scale wireless sensor networks
by: Jing-hua ZHU, et al.
Published: (2013-06-01) -
(ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks
by: BI Ran, et al.
Published: (2011-01-01) -
Anonymous aggregator election protocol for wireless sensor networks
by: Shuai FU, et al.
Published: (2015-02-01) -
Approximate algorithm for median query based on WSN
by: LIU Cai-ping1, et al.
Published: (2011-01-01) -
GSA: node failures tolerent spatial window query processing algorithm in wireless sensor networks
by: LIU Liang, et al.
Published: (2008-01-01)