IEEE Transactions on Signal and Information Processing over Networks最新文献

筛选
英文 中文
An Asymptotically Equivalent GLRT Test for Distributed Detection in Wireless Sensor Networks 无线传感器网络分布式检测的渐近等效 GLRT 检验
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-12-12 DOI: 10.1109/TSIPN.2023.3341407
Juan Augusto Maya;Leonardo Rey Vega;Andrea M. Tonello
{"title":"An Asymptotically Equivalent GLRT Test for Distributed Detection in Wireless Sensor Networks","authors":"Juan Augusto Maya;Leonardo Rey Vega;Andrea M. Tonello","doi":"10.1109/TSIPN.2023.3341407","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3341407","url":null,"abstract":"In this article, we tackle the problem of distributed detection of a radio source emitting a signal. We consider that geographically distributed sensor nodes obtain energy measurements and compute cooperatively a statistic to decide if the source is present or absent. We model the radio source as a stochastic signal and work with spatially statistically dependent measurements. We consider the Generalized Likelihood Ratio Test (GLRT) approach to deal with an unknown multidimensional parameter from the model. We analytically characterize the asymptotic distribution of the statistic when the amount of sensor measurements tends to infinity. Moreover, as the GLRT is not amenable for distributed settings because of the spatial statistical dependence of the measurements, we study a GLRT-like test where the statistical dependence is completely discarded for building this test. Nevertheless, its asymptotic performance is proved to be identical to the original GLRT, showing that the statistical dependence of the measurements has no impact on the detection performance in the asymptotic scenario. Furthermore, the GLRT-like algorithm has a low computational complexity and demands low communication resources, as compared to the GLRT.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"888-900"},"PeriodicalIF":3.2,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10354397","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139050588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic Event-Triggered Fusion Filtering for Multi-Sensor Rectangular Descriptor Systems With Random State Delay 具有随机状态延迟的多传感器矩形描述符系统的动态事件触发融合滤波
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-12-12 DOI: 10.1109/TSIPN.2023.3341410
Jun Hu;Ruonan Luo;Hongli Dong;Cai Chen;Hongjian Liu
{"title":"Dynamic Event-Triggered Fusion Filtering for Multi-Sensor Rectangular Descriptor Systems With Random State Delay","authors":"Jun Hu;Ruonan Luo;Hongli Dong;Cai Chen;Hongjian Liu","doi":"10.1109/TSIPN.2023.3341410","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3341410","url":null,"abstract":"This paper investigates the dynamic event-triggered fusion filtering problem for a class of uncertain multi-sensor rectangular descriptor systems with random state delay. The random state delay is depicted by a Bernoulli distributed random variable. In order to save the communication energy, a dynamic event-triggered mechanism (DETM) is employed to decide whether the measurements are transmitted to the local estimators. Firstly, by introducing the full-order transformation method, the rectangular descriptor systems are converted into the non-descriptor systems with full orders. Secondly, the local filter gains are designed to minimize the upper bounds of filtering error covariances (FECs), where the upper bounds of FECs and the filter gains depend on a group of free positive scalar parameters. To minimize the upper bounds of FECs, the scalar parameters are sought optimally by a numerical method, where the scalars obtained after optimization are called optimal parameters. Subsequently, the fusion filter of the original descriptor system is given by the inverse covariance intersection (ICI) fusion technique. Finally, the effectiveness and advantages of the proposed fusion filtering algorithm are illustrated by providing the experiments with circuit system application.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"836-849"},"PeriodicalIF":3.2,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139034118","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}
引用次数: 0
Stability of Aggregation Graph Neural Networks 聚合图神经网络的稳定性
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-12-12 DOI: 10.1109/TSIPN.2023.3341408
Alejandro Parada-Mayorga;Zhiyang Wang;Fernando Gama;Alejandro Ribeiro
{"title":"Stability of Aggregation Graph Neural Networks","authors":"Alejandro Parada-Mayorga;Zhiyang Wang;Fernando Gama;Alejandro Ribeiro","doi":"10.1109/TSIPN.2023.3341408","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3341408","url":null,"abstract":"In this paper we study the stability properties of aggregation graph neural networks (Agg-GNNs) considering perturbations of the underlying graph. An Agg-GNN is a hybrid architecture where information is defined on the nodes of a graph, but it is processed block-wise by Euclidean CNNs on the nodes after several diffusions on the graph shift operator. We derive stability bounds for the mapping operator associated to a generic Agg-GNN, and we specify conditions under which such operators can be stable to deformations. We prove that the stability bounds are defined by the properties of the filters in the first layer of the CNN that acts on each node. Additionally, we show that there is a close relationship between the number of aggregations, the filter's selectivity, and the size of the stability constants. We also conclude that in Agg-GNNs the selectivity of the mapping operators can be limited by the stability restrictions imposed on the first layer of the CNN stage, but this is compensated by the pointwise nonlinearities and filters in subsequent layers which are not subject to any restriction. This shows a substantial difference with respect to the stability properties of selection GNNs, where the selectivity of the filters in all layers is constrained by their stability. We provide numerical evidence corroborating the results derived, testing the behavior of Agg-GNNs in real life application scenarios considering perturbations of different magnitude.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"850-864"},"PeriodicalIF":3.2,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139034299","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}
引用次数: 0
Optimizing Multi-Agent Systems With Uncertain Dynamics: A Finite-Time Adaptive Distributed Approach 优化动态不确定的多代理系统:有限时间自适应分布式方法
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-12-01 DOI: 10.1109/TSIPN.2023.3338467
Jiayi Lei;Yuan-Xin Li;Choon Ki Ahn
{"title":"Optimizing Multi-Agent Systems With Uncertain Dynamics: A Finite-Time Adaptive Distributed Approach","authors":"Jiayi Lei;Yuan-Xin Li;Choon Ki Ahn","doi":"10.1109/TSIPN.2023.3338467","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3338467","url":null,"abstract":"The topic of this study is adaptive distributed finite-time (FT) optimization of uncertain nonlinear high-order multi-agent systems (MASs) with disturbances. The proposed two-stage framework consists of an optimal FT estimator and an adaptive FT tracking controller. First, the estimator drives the optimization variables towards the optimal solution. In contrast to existing optimization control studies, high-order MASs subject to unknown dynamics are studied in this case. Second, by using the output of the estimator as a reference signal, the tracking controller allows all agents to approach the optimal point. The use of a command filter avoids the problem of discontinuous gradient functions, while it is possible to handle unknown nonlinear functions using fuzzy logic systems (FLSs). We prove, based on the FT stability criterion and convex optimization theory, that the proposed strategy minimizes the total objective function and results in a closed-loop system with bounded signals and FT convergence to the optimal solution. Finally, through a simulation example, the developed approach is verified.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"865-874"},"PeriodicalIF":3.2,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139034117","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}
引用次数: 0
Exponential Synchronization of Reaction-Diffusion Systems on Networks via Asynchronous Intermittent Control 通过异步间歇控制实现网络上反应扩散系统的指数同步
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-12-01 DOI: 10.1109/TSIPN.2023.3338452
Jian Liu;Yan Yang;Yongbao Wu;Seaar Al-Dabooni;Lei Xue;Donald C. Wunsch
{"title":"Exponential Synchronization of Reaction-Diffusion Systems on Networks via Asynchronous Intermittent Control","authors":"Jian Liu;Yan Yang;Yongbao Wu;Seaar Al-Dabooni;Lei Xue;Donald C. Wunsch","doi":"10.1109/TSIPN.2023.3338452","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3338452","url":null,"abstract":"In this article, the exponential synchronization (ES) of the reaction-diffusion systems on networks is studied under an asynchronous aperiodic intermittent control strategy. Different from the preceding studies, the control strategy of each node is different, which is more general and challenging. Meanwhile, to address the asynchrony problem of the asynchronous intermittent control, a new asynchronous average control rate (ACR) is constructed, which is different for each node. The ACR is greater than the lower bound of the control rate in the existing literature, which makes the results of this article less conservative. Then, by constructing the Lyapunov function and adopting the graph theory, some ES criteria are given for the reaction-diffusion systems on networks. Finally, the effectiveness of the algorithms is verified by the numerical simulations.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"825-835"},"PeriodicalIF":3.2,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138678676","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}
引用次数: 0
A Closed-Form Solution for Graph Signal Separation Based on Smoothness 基于平滑性的图形信号分离闭式解法
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-11-28 DOI: 10.1109/TSIPN.2023.3335615
Mohammad-Hassan Ahmad Yarandi;Massoud Babaie-Zadeh
{"title":"A Closed-Form Solution for Graph Signal Separation Based on Smoothness","authors":"Mohammad-Hassan Ahmad Yarandi;Massoud Babaie-Zadeh","doi":"10.1109/TSIPN.2023.3335615","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3335615","url":null,"abstract":"Using smoothness criteria to separate smooth graph signals from their summation is an approach that has recently been proposed (Mohammadi et al., 2023) and shown to have a unique solution up to the uncertainty of the average values of source signals. In this correspondence, closed-form solutions of both exact and approximate decompositions of that approach are presented. This closed-form solution in the exact decomposition also answers the open problem of the estimation error. Additionally, in the case of Gaussian source signals in the presence of additive Gaussian noise, it is shown that the optimization problem of that approach is equivalent to the Maximum A Posteriori (MAP) estimation of the sources.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"823-824"},"PeriodicalIF":3.2,"publicationDate":"2023-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138550231","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}
引用次数: 0
Encoding-Decoding-Based Distributed Fusion Filtering for Multi-Rate Nonlinear Systems With Sensor Resolutions 具有传感器分辨率的多速率非线性系统基于编解码的分布式融合滤波
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-11-23 DOI: 10.1109/TSIPN.2023.3334496
Jun Hu;Shuting Fan;Cai Chen;Hongjian Liu;Xiaojian Yi
{"title":"Encoding-Decoding-Based Distributed Fusion Filtering for Multi-Rate Nonlinear Systems With Sensor Resolutions","authors":"Jun Hu;Shuting Fan;Cai Chen;Hongjian Liu;Xiaojian Yi","doi":"10.1109/TSIPN.2023.3334496","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3334496","url":null,"abstract":"The paper investigates the distributed fusion filtering problem for time-varying multi-rate nonlinear systems (TVMRNSs) with sensor resolutions based on the encoding-decoding scheme (EDS) over sensor networks, where the iterative method is applied to the transformation of TVMRNSs. In order to enhance signal interference-resistant capability and improve transmission efficiency, the EDS based on dynamic quantization is introduced during the measurement transmission. On the basis of the decoded measurements, a local distributed filter is constructed, where an upper bound on the local filtering error (LFE) covariance is derived and the local filter gains are obtained by minimizing the trace of the upper bound. Subsequently, the fusion filtering algorithm is presented according to the covariance intersection fusion criterion. In addition, a sufficient condition is provided via reasonable assumptions to ensure the uniform boundedness of the upper bound on the LFE covariance. Finally, a moving target tracking practical example is taken to show the superiority of the proposed filtering algorithm and discuss the monotonicity of the mean-square error of the fusion filter with respect to the sensor resolutions and quantization intervals.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"811-822"},"PeriodicalIF":3.2,"publicationDate":"2023-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138472866","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}
引用次数: 0
Distributed Estimation by Partial Sensor Measurements Through Transmission Scheduling for Stochastic Systems 随机系统传输调度中部分传感器测量的分布估计
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-11-06 DOI: 10.1109/TSIPN.2023.3329301
Yun Chen;Yuhang Jin;Jianjun Bai;Mengze Zhu
{"title":"Distributed Estimation by Partial Sensor Measurements Through Transmission Scheduling for Stochastic Systems","authors":"Yun Chen;Yuhang Jin;Jianjun Bai;Mengze Zhu","doi":"10.1109/TSIPN.2023.3329301","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3329301","url":null,"abstract":"This paper is concerned with the partial-sensor-measurements-based (PSMB) distributed estimation problem for a class of stochastic systems (SSs) with randomly occurring nonlinearities, persistent bounded noises and quantization effects. The observations of partial sensor nodes are available to be transmitted to the estimators. In order to enhance the utilization efficiency of limited resources, the Round-Robin protocol is deployed to schedule the data transmissions over communication networks. The sufficient condition is established to guarantee the mean-square exponential ultimate boundedness of the augmented estimation error system (AEES), and then the desired PSMB estimator gains are determined by minimizing the mean-square upper bound of the augmented estimation error vector subject to iterative matrix inequalities. Finally, an illustrative example demonstrates the effectiveness of proposed estimation scheme.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"800-810"},"PeriodicalIF":3.2,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134794992","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}
引用次数: 0
Topology Recoverability Prediction for Ad-Hoc Robot Networks: A Data-Driven Fault-Tolerant Approach 自组织机器人网络拓扑可恢复性预测:一种数据驱动的容错方法
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-10-30 DOI: 10.1109/TSIPN.2023.3328275
Matin Macktoobian;Zhan Shu;Qing Zhao
{"title":"Topology Recoverability Prediction for Ad-Hoc Robot Networks: A Data-Driven Fault-Tolerant Approach","authors":"Matin Macktoobian;Zhan Shu;Qing Zhao","doi":"10.1109/TSIPN.2023.3328275","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3328275","url":null,"abstract":"Faults occurring in ad-hoc robot networks may fatally perturb their topologies leading to disconnection of subsets of those networks. Optimal topology synthesis is generally resource-intensive and time-consuming to be done in real time for large ad-hoc robot networks. One should only perform topology re-computations if the probability of topology recoverability after the occurrence of any fault surpasses that of its irrecoverability. We formulate this problem as a binary classification problem. Then, we develop a two-pathway data-driven model based on Bayesian Gaussian mixture models that predicts the solution to a typical problem by two different pre-fault and post-fault prediction pathways. The results, obtained by the integration of the predictions of those pathways, clearly indicate the success of our model in solving the topology (ir)recoverability prediction problem compared to the best of current strategies found in the literature.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"786-799"},"PeriodicalIF":3.2,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"109157461","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}
引用次数: 0
Practical Fixed-Time Consensus Tracking for Second-Order Multi-Agent Systems With Mismatched Disturbances 具有不匹配扰动的二阶多智能体系统的实用定时一致性跟踪
IF 3.2 3区 计算机科学
IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-10-27 DOI: 10.1109/TSIPN.2023.3328276
Jiayi Gong;Fuyong Wang;Zhongxin Liu;Zengqiang Chen
{"title":"Practical Fixed-Time Consensus Tracking for Second-Order Multi-Agent Systems With Mismatched Disturbances","authors":"Jiayi Gong;Fuyong Wang;Zhongxin Liu;Zengqiang Chen","doi":"10.1109/TSIPN.2023.3328276","DOIUrl":"https://doi.org/10.1109/TSIPN.2023.3328276","url":null,"abstract":"This article focuses on the practical fixed-time consensus tracking problem of second-order multi-agent systems (MASs) with mismatched disturbances and matched disturbances under directed graph. Actually, the leader can be a virtual signal or an actual agent. Considering these two situations, followers can track the leader in a finite time with uniform bound. By using the adding-a-power-integrator method, two fixed-time control protocols are proposed, thus the practical fixed-time tracking consensus is achieved in finite time, and settling time is independent of initial states. Finally, several simulations are given to further illustrate the effectiveness of the theory.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"761-769"},"PeriodicalIF":3.2,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"109157457","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信