Partial Diffusion With Quantization Over Networks

IF 3 3区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-03-21 DOI:10.1109/TSIPN.2024.3380374
Xiaoxian Lao;Chunguang Li
{"title":"Partial Diffusion With Quantization Over Networks","authors":"Xiaoxian Lao;Chunguang Li","doi":"10.1109/TSIPN.2024.3380374","DOIUrl":null,"url":null,"abstract":"Distributed estimation over networks has drawn much attention in recent years. In the problem of distributed estimation, a set of nodes is requested to estimate some parameter of interest from noisy measurements. The nodes interact with each other to carry out the task jointly. Many algorithms have been proposed for solving the distributed estimation problem, among which the diffusion strategy is well-accepted. Information diffusion among nodes consumes bandwidth and energy resources, while in real-world applications these resources are limited. To cope with the resources constraint, partial diffusion schemes are developed. Each node only disseminates a subset of entries of interested vector in each interaction. Besides the partial transmission, quantization is another widely adopted technique for saving the communication resources. The two methods work in different aspects and can be considered jointly to make the communication more efficient. In this paper, we propose a partial diffusion scheme with quantization. An optimization problem for communication resources allocation is formulated and solved. In each interaction, the nodes will adaptively determine whether to transmit more entries or assign more bits to quantize each entry. We derive sufficient conditions for convergence of the overall algorithm. We also demonstrate the advantages of the proposed scheme in terms of both convergence speed and estimation accuracy.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"320-331"},"PeriodicalIF":3.0000,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Information Processing over Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10477584/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Distributed estimation over networks has drawn much attention in recent years. In the problem of distributed estimation, a set of nodes is requested to estimate some parameter of interest from noisy measurements. The nodes interact with each other to carry out the task jointly. Many algorithms have been proposed for solving the distributed estimation problem, among which the diffusion strategy is well-accepted. Information diffusion among nodes consumes bandwidth and energy resources, while in real-world applications these resources are limited. To cope with the resources constraint, partial diffusion schemes are developed. Each node only disseminates a subset of entries of interested vector in each interaction. Besides the partial transmission, quantization is another widely adopted technique for saving the communication resources. The two methods work in different aspects and can be considered jointly to make the communication more efficient. In this paper, we propose a partial diffusion scheme with quantization. An optimization problem for communication resources allocation is formulated and solved. In each interaction, the nodes will adaptively determine whether to transmit more entries or assign more bits to quantize each entry. We derive sufficient conditions for convergence of the overall algorithm. We also demonstrate the advantages of the proposed scheme in terms of both convergence speed and estimation accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
部分扩散与网络量化
近年来,网络分布式估算备受关注。在分布式估算问题中,一组节点被要求根据噪声测量结果估算某些相关参数。节点之间相互影响,共同完成任务。为解决分布式估计问题,人们提出了许多算法,其中扩散策略广受认可。节点间的信息扩散会消耗带宽和能源资源,而在实际应用中,这些资源是有限的。为了应对资源限制,人们开发了部分扩散方案。每个节点在每次交互中只传播感兴趣向量的一个子集。除了部分传播外,量化也是另一种被广泛采用的节省通信资源的技术。这两种方法在不同的方面发挥作用,可以联合使用,以提高通信效率。本文提出了一种带有量化功能的部分扩散方案。提出并解决了通信资源分配的优化问题。在每次交互中,节点将自适应地决定是传输更多条目还是分配更多比特来量化每个条目。我们推导出了整个算法收敛的充分条件。我们还证明了所提方案在收敛速度和估计精度方面的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Signal and Information Processing over Networks
IEEE Transactions on Signal and Information Processing over Networks Computer Science-Computer Networks and Communications
CiteScore
5.80
自引率
12.50%
发文量
56
期刊介绍: The IEEE Transactions on Signal and Information Processing over Networks publishes high-quality papers that extend the classical notions of processing of signals defined over vector spaces (e.g. time and space) to processing of signals and information (data) defined over networks, potentially dynamically varying. In signal processing over networks, the topology of the network may define structural relationships in the data, or may constrain processing of the data. Topics include distributed algorithms for filtering, detection, estimation, adaptation and learning, model selection, data fusion, and diffusion or evolution of information over such networks, and applications of distributed signal processing.
期刊最新文献
Reinforcement Learning-Based Event-Triggered Constrained Containment Control for Perturbed Multiagent Systems Finite-Time Performance Mask Function-Based Distributed Privacy-Preserving Consensus: Case Study on Optimal Dispatch of Energy System Discrete-Time Controllability of Cartesian Product Networks Generalized Simplicial Attention Neural Networks A Continuous-Time Algorithm for Distributed Optimization With Nonuniform Time-Delay Under Switching and Unbalanced Digraphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1