传感器网络中基于采样的(epsilon, delta)-近似聚合算法

Siyao Cheng, Jianzhong Li
{"title":"传感器网络中基于采样的(epsilon, delta)-近似聚合算法","authors":"Siyao Cheng, Jianzhong Li","doi":"10.1109/ICDCS.2009.8","DOIUrl":null,"url":null,"abstract":"Aggregation operations are important for users to get summarization information in WSN applications. As large numbers of applications only require approximate aggregation results rather than the exact ones, some approximate aggregation algorithms are proposed to save energy. However, the error bounds of these algorithms are fixed and it is impossible to adjust their error bounds automatically. Therefore, these algorithms cannot reach arbitrary precision requirement given by user. This paper proposes a sampling based approximate aggregation algorithm to satisfy the requirement of arbitrary precision. Besides, two sample data adaptive algorithms are also provided. One is to adapt the sample with the varying of precision requirement. The other is to adapt the sample with the varying of the sensed data in networks. The theoretical analysis and experiment results show that the proposed algorithms have high performance in terms of accuracy and energy cost.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Sampling Based (epsilon, delta)-Approximate Aggregation Algorithm in Sensor Networks\",\"authors\":\"Siyao Cheng, Jianzhong Li\",\"doi\":\"10.1109/ICDCS.2009.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aggregation operations are important for users to get summarization information in WSN applications. As large numbers of applications only require approximate aggregation results rather than the exact ones, some approximate aggregation algorithms are proposed to save energy. However, the error bounds of these algorithms are fixed and it is impossible to adjust their error bounds automatically. Therefore, these algorithms cannot reach arbitrary precision requirement given by user. This paper proposes a sampling based approximate aggregation algorithm to satisfy the requirement of arbitrary precision. Besides, two sample data adaptive algorithms are also provided. One is to adapt the sample with the varying of precision requirement. The other is to adapt the sample with the varying of the sensed data in networks. The theoretical analysis and experiment results show that the proposed algorithms have high performance in terms of accuracy and energy cost.\",\"PeriodicalId\":387968,\"journal\":{\"name\":\"2009 29th IEEE International Conference on Distributed Computing Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 29th IEEE International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.2009.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 29th IEEE International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2009.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

摘要

在WSN应用中,聚合操作对于用户获取摘要信息非常重要。由于大量应用只需要近似的聚合结果,而不需要精确的聚合结果,为了节省能量,提出了一些近似的聚合算法。然而,这些算法的误差范围是固定的,不可能自动调整它们的误差范围。因此,这些算法不能达到用户给出的任意精度要求。为了满足任意精度的要求,提出了一种基于采样的近似聚合算法。此外,还提供了两种样本数据自适应算法。一是根据精度要求的变化来适应样品。二是根据网络中传感数据的变化对样本进行自适应。理论分析和实验结果表明,该算法在精度和能量消耗方面具有较高的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sampling Based (epsilon, delta)-Approximate Aggregation Algorithm in Sensor Networks
Aggregation operations are important for users to get summarization information in WSN applications. As large numbers of applications only require approximate aggregation results rather than the exact ones, some approximate aggregation algorithms are proposed to save energy. However, the error bounds of these algorithms are fixed and it is impossible to adjust their error bounds automatically. Therefore, these algorithms cannot reach arbitrary precision requirement given by user. This paper proposes a sampling based approximate aggregation algorithm to satisfy the requirement of arbitrary precision. Besides, two sample data adaptive algorithms are also provided. One is to adapt the sample with the varying of precision requirement. The other is to adapt the sample with the varying of the sensed data in networks. The theoretical analysis and experiment results show that the proposed algorithms have high performance in terms of accuracy and energy cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信