(ε,δ)-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: | , |
|---|---|
| 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/zh/article/doi/10.3969/j.issn.1000-436X.2013.06.021/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 the(ε,δ)accuracy requirement.DBT-BACA exploits binary search,level-by-level forwarding and delay response technique to effectively reduce the query delay and transmission cost.Theoretical analysis and experimental results show that the proposed algorithms out-perform existing approaches in terms of estimation accuracy,time efficiency and energy cost. |
|---|---|
| ISSN: | 1000-436X |