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

扩散网络中自适应抽样和截尾的低代价算法

A Low-Cost Algorithm for Adaptive Sampling and Censoring in Diffusion Networks

Daniel G. Tiglea, Renato Candido, Magno T. M. Silva

摘要:

分布式信号处理由于其相对于集中式方法的若干优点而引起了科学界的广泛关注。近年来,图形信号处理已经引起了人们的注意,并且在该领域中也提出了自适应分布式解决方案。在经典框架和图形信号处理中,采样和删失技术一直是深入研究的主题,因为与在整个网络中测量和/或传输数据相关联的成本在某些应用中可能是过高的。在本文中,我们提出了一种低成本的自适应机制,用于在扩散网络上进行采样和审查,当网络中的错误很高时,使用来自更多节点的信息,否则使用来自更少节点的信息。该算法在暂态过程中收敛速度快,在稳态过程中计算量和能耗显著降低。作为一种删失技术,我们表明,它是能够明显优于其他解决方案。我们还提出了一个理论分析,以了解其操作,并帮助选择合适的值,其参数。

英文摘要:

Distributed signal processing has attracted widespread attention in the scientific community due to its several advantages over centralized approaches. Recently, graph signal processing has risen to prominence, and adaptive distributed solutions have also been proposed in the area. Both in the classical framework and in graph signal processing, sampling and censoring techniques have been topics of intense research, since the cost associated with measuring and/or transmitting data throughout the entire network may be prohibitive in certain applications. In this paper, we propose a low-cost adaptive mechanism for sampling and censoring over diffusion networks that uses information from more nodes when the error in the network is high and from less nodes otherwise. It presents fast convergence during transient and a significant reduction in computational cost and energy consumption in steady state. As a censoring technique, we show that it is able to noticeably outperform other solutions. We also present a theoretical analysis to give insights about its operation, and to help the choice of suitable values for its parameters.

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

↑