arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.5442cs.NIcs.ITmath.IT
收藏

传感器网络数据汇集压缩树算法研究

On Computing Compression Trees for Data Collection in Sensor Networks

Jian Li, Amol Deshpande, Samir Khuller

摘要:

我们解决的问题,有效地收集相关的数据从有线或无线传感器网络,设计算法与可证明的最优性保证的目的,并了解如何接近我们可以得到已知的理论下限。我们提出的方法是基于找到一个最佳的或接近最佳的{ \em压缩树}为一个给定的传感器网络:压缩树是一个有向树的传感器网络节点,使节点的值被压缩使用的值其父节点。我们认为这个问题在不同的通信模型,包括{ \em广播通信}模型,使许多新的机会,能源效率的数据汇集。我们绘制连接之间的数据汇集问题和以前研究的图形概念,称为{ \em弱连接支配集},我们用它来开发新的近似算法的问题。我们提出了几个合成和现实世界的数据集的比较结果表明,我们的算法构建接近最佳的压缩树,产生显着减少的数据汇集成本。

英文摘要:

We address the problem of efficiently gathering correlated data from a wired or a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and understanding how close we can get to the known theoretical lower bounds. Our proposed approach is based on finding an optimal or a near-optimal {\em compression tree} for a given sensor network: a compression tree is a directed tree over the sensor network nodes such that the value of a node is compressed using the value of its parent. We consider this problem under different communication models, including the {\em broadcast communication} model that enables many new opportunities for energy-efficient data collection. We draw connections between the data collection problem and a previously studied graph concept, called {\em weakly connected dominating sets}, and we use this to develop novel approximation algorithms for the problem. We present comparative results on several synthetic and real-world datasets showing that our algorithms construct near-optimal compression trees that yield a significant reduction in the data collection cost.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑