通信学报 ›› 2013, Vol. 34 ›› Issue (6): 174-183.doi: 10.3969/j.issn.1000-436X.2013.06.021

• 学术通信 • 上一篇    下一篇

大规模无线传感器网络(ε,δ)−近似计数算法

朱敬华1,2,管学敏1,2   

  1. 1 黑龙江大学 计算机科学技术学院,黑龙江 哈尔滨 150001
    2 黑龙江省数据库与并行计算重点实验室,黑龙江 哈尔滨 150001
  • 出版日期:2013-06-25 发布日期:2017-07-20
  • 基金资助:
    国家自然科学基金青年基金资助项目;哈尔滨市科技创新人才专项基金资助项目;黑龙江省高校科技创新团队建设计划基金资助项目

(ε,δ)-approximate counting algorithm for large scale wireless sensor networks

Jing-hua ZHU1,2,Xue-min GUAN1,2   

  1. 1 Department of Computer Science and Technology,Heilongjiang University,Harbin 150001,China
    2 Key Laboratory of Database and Parallel Computing Heilongjiang Province,Harbin 150001,China
  • Online:2013-06-25 Published:2017-07-20
  • Supported by:
    The National Science Foundation for Young Scholars of China;The Foundation of Harbin Techno-logical Innovation;The University Science and Technology Innovation Team Program of Heilongjiang Province

摘要:

研究了大规模无线传感器网络中的近似计数问题,提出2个基于数字二叉树(DBT,digital binary tree)协议的近似计数算法DBT-ACA和DBT-BACA算法能够以O(log logn)的时间复杂性返回(ε,δ)-精度保证的近似计数结果。DBT-BACA采用了二分搜索、逐层转发和延迟响应等技术,有效地减少了查询时间和数据通信量。理论分析和实验结果表明,提出的算法在近似结果的精准度、时间效率和能量开销等方面均优于现有的近似计数算法。

关键词: 无线传感器网络, 数据聚集, 近似算法, 数字二叉树

Abstract:

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.

Key words: wireless sensor networks, data aggregation, approximate algorithms, digital binary tree

No Suggested Reading articles found!