arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.01773cs.ITmath.IT
收藏

传感器集群分布式数据压缩:最大独立流方法

Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow Approach

Ni Ding, Parastoo Sadeghi, David Smith, Thierry Rakotoarivelo

摘要:

让一个传感器集群(网络)通过通信链路连接,每个链路都有一个容量上限。每个传感器观察一个离散的随机变量在私人和一个传感器作为簇头或汇。在这里,我们制定的问题,如何让传感器编码他们的意见,使压缩数据的方向是一个可行的流向汇。我们证明了这个问题可以解决现有的最大独立流(MIF)算法在多项式时间。此外,我们发现,该算法实际上确定了一个最佳的解决方案,通过递归地推动剩余的随机性的来源,通过不饱和的通信链路对汇。然后,我们表明,MIF算法可以以分布式方式实现。对于具有整数通信容量的网络,我们提出了一个整数MIF算法,它的完成速度比MIF快得多。最后,指出传感器集群中数据压缩问题的本质是在两个子模多面体的交集中寻求最大独立信息流,这一点可以进一步用于改进MIF算法。

英文摘要:

Let a cluster (network) of sensors be connected by the communication links, each link having a capacity upper bound. Each sensor observes a discrete random variable in private and one sensor serves as a cluster header or sink. Here, we formulate the problem of how to let the sensors encode their observations such that the direction of compressed data is a feasible flow towards the sink. We demonstrate that this problem can be solved by an existing maximum independent flow (MIF) algorithm in polynomial time. Further, we reveal that this algorithm in fact determines an optimal solution by recursively pushing the remaining randomness in the sources via unsaturated communication links towards the sink. We then show that the MIF algorithm can be implemented in a distributed manner. For those networks with integral communication capacities, we propose an integral MIF algorithm which completes much faster than MIF. Finally, we point out that the nature of the data compression problem in a sensor cluster is to seek the maximum independent information flow in the intersection of two submodular polyhedra, which can be further utilized to improve the MIF algorithm in the future.

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

↑