(ε,δ)-approximate counting algorithm for large scale wireless sensor networks
The problem of approximate counting for large scale wireless sensor networks was studied.Two approximate counting algorithms,DBT-ACA and DBT-BACA,based on DBT (digital binary tree) protocol were also proposed.The algorithms presented could attain the counting result in O(log logn)time while meeting...
Saved in:
| Main Authors: | Jing-hua ZHU, Xue-min GUAN |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-06-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails#10.3969/j.issn.1000-436X.2013.06.021 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
ε-approximate spatial-window aggregation algorithm in wireless sensor networks
by: Jing GAO, et al.
Published: (2012-02-01) -
(ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks
by: BI Ran, et al.
Published: (2011-01-01) -
Distance-based target tracking algorithm in binary sensor network
by: SUN Xiao-yan1, et al.
Published: (2010-01-01) -
Distance-based target tracking algorithm in binary sensor network
by: SUN Xiao-yan1, et al.
Published: (2010-01-01) -
Anonymous aggregator election protocol for wireless sensor networks
by: Shuai FU, et al.
Published: (2015-02-01)