Yan Yu;Chao Yang;Wenjie Ding;Wen Yang;Xiaofan Wang
{"title":"Dual-Protection Method Against Eavesdroppers for Distributed State Estimation","authors":"Yan Yu;Chao Yang;Wenjie Ding;Wen Yang;Xiaofan Wang","doi":"10.1109/TSIPN.2025.3563774","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3563774","url":null,"abstract":"This paper examines a security issue for state estimation over a wireless sensor network. The state estimates are transmitted among neighboring nodes through wireless channels in a distributed network, wherein the transmission of the data are vulnerable to the intercept from eavesdroppers, leading to important data privacy leakage. To prevent eavesdroppers from obtaining state estimates, we propose a dual-protection method that combines dynamic transformation with lightweight encryption, which aims to protect the privacy without raising suspicion from eavesdroppers. Furthermore, we consider the scenarios where eavesdroppers utilize side-channel information to gather data and attempt to deduce the encryption mechanism, subsequently inferring the real state estimate. We also provide the analysis to show that the eavesdropper with inference capabilities could not influence the estimation performance of sensors. Finally, the numerical examples are provided to illustrate the effectiveness of the privacy-preserving method.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"427-438"},"PeriodicalIF":3.0,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143913408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ehsan Lari;Reza Arablouei;Vinay Chakravarthi Gogineni;Stefan Werner
{"title":"Resilience in Online Federated Learning: Mitigating Model-Poisoning Attacks via Partial Sharing","authors":"Ehsan Lari;Reza Arablouei;Vinay Chakravarthi Gogineni;Stefan Werner","doi":"10.1109/TSIPN.2025.3559444","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3559444","url":null,"abstract":"Federated learning (FL) allows training machine learning models on distributed data without compromising privacy. However, FL is vulnerable to model-poisoning attacks where malicious clients tamper with their local models to manipulate the global model. In this work, we investigate the resilience of the partial-sharing online FL (PSO-Fed) algorithm against such attacks. PSO-Fed reduces communication overhead by allowing clients to share only a fraction of their model updates with the server. We demonstrate that this partial sharing mechanism has the added advantage of enhancing PSO-Fed's robustness to model-poisoning attacks. Through theoretical analysis, we show that PSO-Fed maintains convergence even under Byzantine attacks, where malicious clients inject noise into their updates. Furthermore, we derive a formula for PSO-Fed's mean square error, considering factors like stepsize, attack probability, and the number of malicious clients. Interestingly, we find a non-trivial optimal stepsize that maximizes PSO-Fed's resistance to these attacks. Extensive numerical experiments confirm our theoretical findings and showcase PSO-Fed's superior performance against model-poisoning attacks compared to other leading FL algorithms.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"388-400"},"PeriodicalIF":3.0,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143883475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Generic Framework for Fixed-Time Synchronization of Large Delayed Impulsive Neural Networks","authors":"Yishu Wang;Jianquan Lu;Xinsong Yang;Bangxin Jiang","doi":"10.1109/TSIPN.2025.3561551","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3561551","url":null,"abstract":"This article investigates fixed-time synchronization (FxTS) for neural networks with delayed impulses. There are two main challenges associated with the delay in this area. One is that it causes the networks to oscillate close to the equilibrium. The other is that it causes the synchronization criterion to be very conservative, particularly when the impulses contain large (exceeding impulsive intervals) delays. To overcome these challenges, we propose the concept of equivalent impulsive sequence and the method of delayed impulsive sequence decomposition, respectively. Meanwhile, we establish a framework that equivalently transforms the networks with large delays into a collection of networks with small (shorter than impulsive intervals) delays. Particularly, this transformation is a sufficient and necessary condition, and thus does not induce any conservatism. Following this, we delineate the FxTS criteria for the networks containing synchronizing and desynchronizing impulses. Interestingly, it is shown that under some conditions, the large delay has no effect on the FxTS criterion of networks with synchronizing impulses, but destroys those of networks with desynchronizing impulses. Furthermore, we prove the necessity and rationality of the FxTS criterion. Finally, the conclusions are substantiated through numerical demonstrations.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"439-449"},"PeriodicalIF":3.0,"publicationDate":"2025-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143913409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dual Averaging for Distributed Unbalanced Optimization With Delayed Information","authors":"Qing Huang;Yuan Fan;Songsong Cheng","doi":"10.1109/TSIPN.2025.3559433","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3559433","url":null,"abstract":"In this paper, we study a category of distributed constrained optimization problems where each agent has access to local information, communicates with its neighbors, and cooperatively minimizes the aggregated cost functions over time-varying unbalanced graphs. To address the considered problems, we propose a distributed dual averaging algorithm based on a row-stochastic weighted matrix (DDAR), which improves the robustness of network topology compared to conventional push-sum algorithms. Moreover, we develop a modified version of DDAR with delayed information (DDARD), which considers the delays of both network communication and gradient calculation, enhancing the algorithm's flexibility in communication and iteration. Our analysis demonstrates that the DDAR and DDARD achieve the optimal value at rates of <inline-formula><tex-math>${mathcal {O}}(frac{N}{(1-lambda)sqrt{T}})$</tex-math></inline-formula> and <inline-formula><tex-math>${mathcal {O}}(frac{{tilde{tau }}_{}^{2}N}{(1-{tilde{lambda }})sqrt{T}})$</tex-math></inline-formula>, respectively. Finally, the theoretical results are confirmed by simulation on a logistic regression problem.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"366-377"},"PeriodicalIF":3.0,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143875169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed Proportional-Integral Algorithms for Multiple Coalition Games Under Limited Communication Resources","authors":"Jiaxun Liu;Dong Wang;Jiashuo Liu;Xiwang Dong","doi":"10.1109/TSIPN.2025.3559442","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3559442","url":null,"abstract":"This paper studies the algorithm design for multiple coalition games under limited communication resources, in which the players in the same coalition cooperatively optimize the summation of cost functions in this coalition and do not care about the costs of other coalitions. To address this game, we develop a distributed proportional-integral algorithm based on the coalition estimate strategy and the proportional-integral principle. Furthermore, when the communication resource is concretely quantified by bit rates in communication channels, we propose a coding-decoding-based distributed proportional-integral algorithm based on the distributed proportional-integral algorithm and coding-decoding rules for seeking the Nash equilibrium of multiple coalition games. It proves that both algorithms linearly and precisely converge to the Nash equilibrium in spite of limited communication resources. Then, the necessary and sufficient condition for the linear convergence of the proposed algorithm about the requirement of bit rates is presented. Moreover, the relationship between the bit rate and the convergence speed of the proposed algorithm is also theoretically explained. Lastly, the simulation in formation problems of unmanned vehicle swarms is presented to demonstrate the effectiveness of proposed algorithms.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"450-459"},"PeriodicalIF":3.0,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144090763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Coherence and Robustness Analysis for a Family of Unbalanced Networks","authors":"Jia-Bao Liu;Xu Wang;Liang Hua;Jinde Cao;Liping Chen","doi":"10.1109/TSIPN.2025.3555164","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3555164","url":null,"abstract":"This study focuses on the coherence in a class of unbalanced networks, emphasizing the investigation of the impact of leader selection and network parameters on coherence. We discuss three different categories of consensus algorithms: leaderless algorithms of first and second orders, and first-order leader-follower algorithm. Firstly, we derive exact solutions for leaderless network coherence in the first and second orders. Secondly, we design various leader allocation schemes for the first-order leader-follower networks, obtaining expressions correlated with the network scale <inline-formula><tex-math>$N$</tex-math></inline-formula>, the double-ring cardinalities <inline-formula><tex-math>$p$</tex-math></inline-formula> and <inline-formula><tex-math>$q$</tex-math></inline-formula>, and the number of leaders <inline-formula><tex-math>$k$</tex-math></inline-formula>. Thirdly, we conduct numerical simulations and robustness analyses to explore the impact of leader quantity and topology structure on network coherence. Specifically, the conclusions are as follows: (1) When <inline-formula><tex-math>$N$</tex-math></inline-formula> decreases, an increase in <inline-formula><tex-math>$k$</tex-math></inline-formula> demonstrates improved network coherence. (2) The smaller the difference between <inline-formula><tex-math>$p$</tex-math></inline-formula> and <inline-formula><tex-math>$q$</tex-math></inline-formula>, the better the coherence. (3) The smaller the sum of <inline-formula><tex-math>$p$</tex-math></inline-formula> and <inline-formula><tex-math>$q$</tex-math></inline-formula>, the stronger the robustness. (4) Uniform distribution of <inline-formula><tex-math>$k_{1}$</tex-math></inline-formula> and <inline-formula><tex-math>$k_{2}$</tex-math></inline-formula> leads to optimal coherence. Finally, the Laplacian energy and Kirchhoff index of the network are analyzed.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"378-387"},"PeriodicalIF":3.0,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143883261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Rate Sampled-Data Secure Fusion Estimation Against Malicious Hybrid Attacks","authors":"Haiyu Song;Siqing Ye;Peng Shi;Wen-An Zhang;Li Yu","doi":"10.1109/TSIPN.2025.3559434","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3559434","url":null,"abstract":"This paper investigates the Kalman fusion estimation problem for multi-sensor systems based on multi-rate sampled data within a non-secure network environment. For each sensor, an innovative multi-rate sampling estimation module is proposed, allowing for multiple samplings within a single estimation cycle to gather as much sampled information as possible. The sampled data during transmission is thought to encounter three potential scenarios: being subjected to DoS attack, FDI attack, or undergoing normal transmission. These three potential scenarios are modeled as a random phenomenon described by two sets of Bernoulli variables. A unified information framework is subsequently introduced, adept at encompassing the three attack scenarios along with the multi-rate sampling process. This framework serves as the basis for the design of a local secure Kalman estimator, followed by stability analysis. Finally, a distributed secure fusion estimation algorithm is proposed, and its effectiveness is demonstrated through a simulation example.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"401-412"},"PeriodicalIF":3.0,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143883428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Juan Cerviño;Md Asadullah Turja;Hesham Mostafa;Nageen Himayat;Alejandro Ribeiro
{"title":"Distributed Training of Large Graph Neural Networks With Variable Communication Rates","authors":"Juan Cerviño;Md Asadullah Turja;Hesham Mostafa;Nageen Himayat;Alejandro Ribeiro","doi":"10.1109/TSIPN.2025.3557584","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3557584","url":null,"abstract":"Training Graph Neural Networks (GNNs) on large graphs presents unique challenges due to the large memory and computing requirements. Distributed GNN training, where the graph is partitioned across multiple machines, is a common approach to training GNNs on large graphs. However, as the graph cannot generally be decomposed into small non-interacting components, data communication between the training machines quickly limits training speeds. Compressing the communicated node activations by a fixed amount improves the training speeds, but lowers the accuracy of the trained GNN. In this paper, we introduce a variable compression scheme for reducing the communication volume in distributed GNN training without compromising the accuracy of the learned model.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"413-426"},"PeriodicalIF":3.0,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143902663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaoqing Huang;Andersen Ang;Kun Huang;Jie Zhang;Yijie Wang
{"title":"Inhomogeneous Graph Trend Filtering via a $ell _{2,0}$-Norm Cardinality Penalty","authors":"Xiaoqing Huang;Andersen Ang;Kun Huang;Jie Zhang;Yijie Wang","doi":"10.1109/TSIPN.2025.3553025","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3553025","url":null,"abstract":"We study estimation of piecewise smooth signals over a graph. We propose a <inline-formula><tex-math>$ell _{2,0}$</tex-math></inline-formula>-norm penalized Graph Trend Filtering (GTF) model to estimate piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness across the nodes. We prove that the proposed GTF model is simultaneously a k-means clustering on the signal over the nodes and a minimum graph cut on the edges of the graph, where the clustering and the cut share the same assignment matrix. We propose two methods to solve the proposed GTF model: a spectral decomposition method and a method based on simulated annealing. In the experiment on synthetic and real-world datasets, we show that the proposed GTF model has a better performances compared with existing approaches on the tasks of denoising, support recovery and semi-supervised classification. We also show that the proposed GTF model can be solved more efficiently than existing models for the dataset with a large edge set.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"353-365"},"PeriodicalIF":3.0,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143761313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed Least Mean Square Estimation With Communication Noises Over Random Graphs","authors":"Xiaozheng Fu;Siyu Xie;Tao Li","doi":"10.1109/TSIPN.2025.3536103","DOIUrl":"https://doi.org/10.1109/TSIPN.2025.3536103","url":null,"abstract":"For the online distributed estimation problem of time-varying parameters, we study a linear regression model with measurement noises over time-varying random graphs. We propose a distributed normalized least mean square (LMS) algorithm, where each node updates its own estimate by the least mean square term, and sums the differences between its own estimate and the estimates of its neighbors with additive and multiplicative communication noises by the consensus term. By the algebraic graph theory and the stochastic analysis techniques, we obtain sufficient conditions for the boundedness of the tracking error. For a sequence of general random graphs, if the random graphs and the regression matrices satisfy the stochastic spatio-temporal persistence of excitation condition, then the mean-square tracking error is bounded by choosing appropriate constant gains. Furthermore, for conditional balanced graphs and Markovian switching graphs, we give sufficient conditions such that the persistence of excitation condition holds. Finally, we illustrate the effectiveness of the theoretical results through a numerical example.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"11 ","pages":"289-303"},"PeriodicalIF":3.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143655014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}