Pub Date : 2024-04-02DOI: 10.1109/JSYST.2024.3379438
Radwa Sultan;Ahmed Shamseldeen
We consider a single-cell full-duplex (FD) network. In FD transmission, the downlink rate is degraded by the cochannel interference (CCI) from the active uplink transmission. In this letter, we study how utilizing reconfigurable intelligent surfaces (RIS) can mitigate the effects of the CCI. In a multiple-input-multiple-output (MIMO) network, we consider two scenarios for CCI cancellation. In the first scenario, we assume that both the RIS-base station uplink and downlink direct links suffer from deep fading, i.e., they do not exist. In that case, the CCI minimization problem will be cast as an unconstrained manifold optimization problem. In the second scenario, we assume that the RIS-base station uplink and downlink direct links exist and the RIS controls all the network's links. In that case, the CCI minimization problem will be constrained by the uplink and the downlink channel gains, and accordingly, a penalty-based approach will be adopted to solve the CCI minimization problem. Our results show that utilizing the RIS can be very effective in minimizing the CCI and achieving a higher downlink rate than benchmark schemes.
我们考虑的是单蜂窝全双工（FD）网络。在 FD 传输中，下行链路速率会因主动上行链路传输的同信道干扰（CCI）而降低。在这封信中，我们研究了如何利用可重构智能表面（RIS）来减轻 CCI 的影响。在多输入多输出（MIMO）网络中，我们考虑了两种消除 CCI 的方案。在第一种情况下，我们假设 RIS-基站上行链路和下行链路的直接链路都存在深度衰落，即不存在深度衰落。在这种情况下，CCI 最小化问题将被视为一个无约束流形优化问题。在第二种情况下，我们假设 RIS 与基站之间存在上行和下行直接链路，并且 RIS 控制着网络的所有链路。在这种情况下，CCI 最小化问题将受到上行链路和下行链路信道增益的限制，因此将采用基于惩罚的方法来解决 CCI 最小化问题。我们的研究结果表明，与基准方案相比，利用 RIS 可以非常有效地最小化 CCI，并获得更高的下行链路速率。
{"title":"Uplink–Downlink Cochannel Interference Cancellation in RIS-Aided Full-Duplex Networks","authors":"Radwa Sultan;Ahmed Shamseldeen","doi":"10.1109/JSYST.2024.3379438","DOIUrl":"10.1109/JSYST.2024.3379438","url":null,"abstract":"We consider a single-cell full-duplex (FD) network. In FD transmission, the downlink rate is degraded by the cochannel interference (CCI) from the active uplink transmission. In this letter, we study how utilizing reconfigurable intelligent surfaces (RIS) can mitigate the effects of the CCI. In a multiple-input-multiple-output (MIMO) network, we consider two scenarios for CCI cancellation. In the first scenario, we assume that both the RIS-base station uplink and downlink direct links suffer from deep fading, i.e., they do not exist. In that case, the CCI minimization problem will be cast as an unconstrained manifold optimization problem. In the second scenario, we assume that the RIS-base station uplink and downlink direct links exist and the RIS controls all the network's links. In that case, the CCI minimization problem will be constrained by the uplink and the downlink channel gains, and accordingly, a penalty-based approach will be adopted to solve the CCI minimization problem. Our results show that utilizing the RIS can be very effective in minimizing the CCI and achieving a higher downlink rate than benchmark schemes.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1220-1223"},"PeriodicalIF":4.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582989","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}
Pub Date : 2024-04-02DOI: 10.1109/JSYST.2024.3379572
Yuhan Xie;Sanbo Ding;Yanhui Jing;Xiangpeng Xie
This article addresses the problem of distributed set-membership estimation for a resource-constrained sensor network. The central aim is to acquire the desired ellipsoidal estimation sets while simultaneously accomplishing improved resource allocation efficiency. Toward this aim, a novel periodic-event-driven dynamic quantization algorithm is developed for each sensor node to save bandwidth on wireless channels and improve measurement accuracy. Such a scheme allows the sensors to implement the quantization process in a dynamic manner. In addition, it conducts a remarkable tradeoff between quantization performance and network energy consumption. Subsequently, a sufficient condition is derived in order to obtain the codesign criterion of the estimator and event-driven scheme using a dedicated auxiliary function. Especially, a recursive convex optimization algorithm is proposed to achieve the suitable ellipsoidal estimation constraint. Finally, the validity of the theoretical results is demonstrated through two illustrative examples.
{"title":"Distributed Set-Membership Estimation Over Sensor Networks via an Event-Driven Dynamic Quantization Scheme","authors":"Yuhan Xie;Sanbo Ding;Yanhui Jing;Xiangpeng Xie","doi":"10.1109/JSYST.2024.3379572","DOIUrl":"10.1109/JSYST.2024.3379572","url":null,"abstract":"This article addresses the problem of distributed set-membership estimation for a resource-constrained sensor network. The central aim is to acquire the desired ellipsoidal estimation sets while simultaneously accomplishing improved resource allocation efficiency. Toward this aim, a novel periodic-event-driven dynamic quantization algorithm is developed for each sensor node to save bandwidth on wireless channels and improve measurement accuracy. Such a scheme allows the sensors to implement the quantization process in a dynamic manner. In addition, it conducts a remarkable tradeoff between quantization performance and network energy consumption. Subsequently, a sufficient condition is derived in order to obtain the codesign criterion of the estimator and event-driven scheme using a dedicated auxiliary function. Especially, a recursive convex optimization algorithm is proposed to achieve the suitable ellipsoidal estimation constraint. Finally, the validity of the theoretical results is demonstrated through two illustrative examples.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1151-1161"},"PeriodicalIF":4.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582894","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}
Pub Date : 2024-04-02DOI: 10.1109/JSYST.2024.3377452
Ziheng Shi;Wencheng Zou;Jian Guo
In this article, the fault-tolerant leader-following consensus problem is investigated for a class of multiagent systems subject to random intermittent actuator faults. The process of actuator fault occurrence for each agent is described by a Markov chain. By the backstepping procedure with virtual controllers designed based on sampled states, a novel fault-tolerant periodic sampled-data consensus protocol scheme is developed to ensure that all followers can track the trajectory of a leader. Different from existing works, in the proposed design framework, both zero and time-variant effectiveness of the actuators are considered. Using the graph theory, probability theory, and Lyapunov function method, the sufficient conditions on the fault-tolerant leader-following consensus are derived. Finally, two numerical examples are provided to demonstrate the effectiveness of the proposed scheme.
{"title":"Sampled-Data Consensus Protocol for Multiagent Systems Subject to Random Intermittent Actuator Faults","authors":"Ziheng Shi;Wencheng Zou;Jian Guo","doi":"10.1109/JSYST.2024.3377452","DOIUrl":"10.1109/JSYST.2024.3377452","url":null,"abstract":"In this article, the fault-tolerant leader-following consensus problem is investigated for a class of multiagent systems subject to random intermittent actuator faults. The process of actuator fault occurrence for each agent is described by a Markov chain. By the backstepping procedure with virtual controllers designed based on sampled states, a novel fault-tolerant periodic sampled-data consensus protocol scheme is developed to ensure that all followers can track the trajectory of a leader. Different from existing works, in the proposed design framework, both zero and time-variant effectiveness of the actuators are considered. Using the graph theory, probability theory, and Lyapunov function method, the sufficient conditions on the fault-tolerant leader-following consensus are derived. Finally, two numerical examples are provided to demonstrate the effectiveness of the proposed scheme.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1368-1379"},"PeriodicalIF":4.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582675","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}
Pub Date : 2024-04-02DOI: 10.1109/JSYST.2024.3380584
Dan Ye;Xiaoke Liu;Pengyu Li
This article focuses on the design of stochastic stealthy attacks in linear cyber-physical systems (CPSs), where the objective of attackers is to degrade the system's performance and maintain a delicate balance between detection and false alarm rates. In contrast to the commonly used stealthiness constraint defined using the Kullback–Leibler divergence, the $varepsilon$ -stealthiness is established based on the detector's tolerance against the false alarm rate, providing an intuitive correlation between the attacker's stealthiness and the detection rate from a probabilistic perspective. Furthermore, we obtain an upper bound on the attack performance using the Schur–Horn theorem and devise a corresponding stealth attack strategy to ensure compliance with this bound. Finally, simulations with a three-tank system model are executed to corroborate the theoretical results.
{"title":"Probability-Based Stochastic Stealthy Attacks in Cyber-Physical Systems","authors":"Dan Ye;Xiaoke Liu;Pengyu Li","doi":"10.1109/JSYST.2024.3380584","DOIUrl":"10.1109/JSYST.2024.3380584","url":null,"abstract":"This article focuses on the design of stochastic stealthy attacks in linear cyber-physical systems (CPSs), where the objective of attackers is to degrade the system's performance and maintain a delicate balance between detection and false alarm rates. In contrast to the commonly used stealthiness constraint defined using the Kullback–Leibler divergence, the \u0000<bold><inline-formula><tex-math>$varepsilon$</tex-math></inline-formula></b>\u0000-stealthiness is established based on the detector's tolerance against the false alarm rate, providing an intuitive correlation between the attacker's stealthiness and the detection rate from a probabilistic perspective. Furthermore, we obtain an upper bound on the attack performance using the Schur–Horn theorem and devise a corresponding stealth attack strategy to ensure compliance with this bound. Finally, simulations with a three-tank system model are executed to corroborate the theoretical results.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1288-1295"},"PeriodicalIF":4.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582897","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}
Pub Date : 2024-03-31DOI: 10.1109/JSYST.2024.3402156
Ahmed M. Jasim;Hamed Al-Raweshidy
Edge/fog computing has gained significant popularity as a computing paradigm that facilitates real-time applications, especially in healthcare systems. However, deploying these systems in real-world healthcare scenarios presents technical challenges, among which load balancing is a key concern. Load balancing aims to distribute workloads evenly across multiple nodes in a network to optimize processing and communication efficiency. This article proposes an adaptive load-balancing method that combines the strengths of static and software-defined networking (SDN)-based load balancing algorithms for edge/fog-based healthcare systems. A new algorithm called load balancing of optimal edge-server placement (LB-OESP) is proposed to balance the workload statically in the systems, followed by the presentation of an SDN-based greedy heuristic (SDN-GH) algorithm to manage the data flow dynamically within the network. The LB-OESP algorithm effectively balances workloads while minimizing the number of edge servers required, thereby improving system performance and saving costs. The SDN-GH algorithm leverages the benefits of SDN to dynamically balance the load and provide a more efficient system. Simulation results demonstrate that the proposed method provides an adaptive load-balancing solution that takes into consideration changing network conditions and ensures improved system performance and reliability. Furthermore, the proposed method offers a 12% reduction in system latency and up to 28% lower deployment costs compared to the previous studies. The proposed method is a promising solution for edge/fog-based healthcare systems, providing an efficient and cost-effective approach to managing workloads.
边缘/雾计算作为一种可促进实时应用的计算范例，特别是在医疗保健系统中，已经获得了极大的普及。然而，在现实世界的医疗保健场景中部署这些系统面临着技术挑战，其中负载平衡是一个关键问题。负载平衡的目的是将工作负载平均分配到网络中的多个节点上，以优化处理和通信效率。本文提出了一种自适应负载平衡方法，它结合了静态和基于软件定义网络（SDN）的负载平衡算法的优势，适用于基于边缘/雾的医疗系统。我们提出了一种名为 "最佳边缘服务器位置负载平衡（LB-OESP）"的新算法，用于静态平衡系统中的工作负载，随后又提出了一种基于 SDN 的贪婪启发式（SDN-GH）算法，用于动态管理网络中的数据流。LB-OESP 算法能有效平衡工作负载，同时最大限度地减少所需的边缘服务器数量，从而提高系统性能并节约成本。SDN-GH 算法利用 SDN 的优势动态平衡负载，提供更高效的系统。仿真结果表明，所提出的方法提供了一种自适应负载平衡解决方案，能考虑到不断变化的网络条件，确保提高系统性能和可靠性。此外，与之前的研究相比，所提出的方法可将系统延迟降低 12%，部署成本最多可降低 28%。所提出的方法为基于边缘/雾的医疗保健系统提供了一种高效、经济的工作负载管理方法，是一种很有前途的解决方案。
{"title":"An Adaptive SDN-Based Load Balancing Method for Edge/Fog-Based Real-Time Healthcare Systems","authors":"Ahmed M. Jasim;Hamed Al-Raweshidy","doi":"10.1109/JSYST.2024.3402156","DOIUrl":"10.1109/JSYST.2024.3402156","url":null,"abstract":"Edge/fog computing has gained significant popularity as a computing paradigm that facilitates real-time applications, especially in healthcare systems. However, deploying these systems in real-world healthcare scenarios presents technical challenges, among which load balancing is a key concern. Load balancing aims to distribute workloads evenly across multiple nodes in a network to optimize processing and communication efficiency. This article proposes an adaptive load-balancing method that combines the strengths of static and software-defined networking (SDN)-based load balancing algorithms for edge/fog-based healthcare systems. A new algorithm called load balancing of optimal edge-server placement (LB-OESP) is proposed to balance the workload statically in the systems, followed by the presentation of an SDN-based greedy heuristic (SDN-GH) algorithm to manage the data flow dynamically within the network. The LB-OESP algorithm effectively balances workloads while minimizing the number of edge servers required, thereby improving system performance and saving costs. The SDN-GH algorithm leverages the benefits of SDN to dynamically balance the load and provide a more efficient system. Simulation results demonstrate that the proposed method provides an adaptive load-balancing solution that takes into consideration changing network conditions and ensures improved system performance and reliability. Furthermore, the proposed method offers a 12% reduction in system latency and up to 28% lower deployment costs compared to the previous studies. The proposed method is a promising solution for edge/fog-based healthcare systems, providing an efficient and cost-effective approach to managing workloads.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1139-1150"},"PeriodicalIF":4.0,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543196","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190754","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}
Pub Date : 2024-03-30DOI: 10.1109/JSYST.2024.3402664
Baogang Li;Lu Chen;Zhi Yang;Hongyin Xiang
The time-sensitive networking (TSN) working group standardizes time-aware shapes (TAS) to reduce network latency, but the traditional TAS standard lacks adaptability and cannot perform well in dynamically changing environments. The continuously developing artificial intelligence techniques can be combined with TSN to better adapt the dynamically changing environments. Therefore, we utilize deep reinforcement learning (DRL) algorithms to dynamically configure the network to improve its adaptability. Meanwhile, we propose the queuing transmission method in TAS by incorporating transmission windows for different types of traffic, to make resource allocation simpler and more efficient. However, DRL algorithms usually take a lot of time to train, which is contrary to the delay sensitivity of TAS. Hence, we propose an improved DRL algorithm, called preDQN, where the network prediction is used to help the agent explore the environment more efficiently. Experimental validation is carried out in a simulation environment, and the experimental results show that the scheme can significantly improve the resource utilization, reduce the end-to-end delay and packet loss rate.
时间敏感网络（TSN）工作组将时间感知形状（TAS）标准化，以减少网络延迟，但传统的 TAS 标准缺乏适应性，无法在动态变化的环境中发挥良好作用。不断发展的人工智能技术可以与 TSN 相结合，从而更好地适应动态变化的环境。因此，我们利用深度强化学习（DRL）算法对网络进行动态配置，以提高其适应性。同时，我们在 TAS 中提出了队列传输方法，为不同类型的流量加入传输窗口，使资源分配更简单、更高效。然而，DRL 算法通常需要大量时间来训练，这与 TAS 的延迟敏感性相悖。因此，我们提出了一种改进的 DRL 算法，称为 preDQN，其中网络预测用于帮助代理更有效地探索环境。我们在仿真环境中进行了实验验证，实验结果表明，该方案能显著提高资源利用率，降低端到端延迟和丢包率。
{"title":"preDQN-Based TAS Traffic Scheduling in Intelligence Endogenous Networks","authors":"Baogang Li;Lu Chen;Zhi Yang;Hongyin Xiang","doi":"10.1109/JSYST.2024.3402664","DOIUrl":"10.1109/JSYST.2024.3402664","url":null,"abstract":"The time-sensitive networking (TSN) working group standardizes time-aware shapes (TAS) to reduce network latency, but the traditional TAS standard lacks adaptability and cannot perform well in dynamically changing environments. The continuously developing artificial intelligence techniques can be combined with TSN to better adapt the dynamically changing environments. Therefore, we utilize deep reinforcement learning (DRL) algorithms to dynamically configure the network to improve its adaptability. Meanwhile, we propose the queuing transmission method in TAS by incorporating transmission windows for different types of traffic, to make resource allocation simpler and more efficient. However, DRL algorithms usually take a lot of time to train, which is contrary to the delay sensitivity of TAS. Hence, we propose an improved DRL algorithm, called preDQN, where the network prediction is used to help the agent explore the environment more efficiently. Experimental validation is carried out in a simulation environment, and the experimental results show that the scheme can significantly improve the resource utilization, reduce the end-to-end delay and packet loss rate.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"997-1008"},"PeriodicalIF":4.0,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190827","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}
Pub Date : 2024-03-29DOI: 10.1109/JSYST.2024.3401148
Yuyang Du;Liang Hao;Yiming Lei;Qun Yang;Shiqi Xu
Signal clipping is a well-established method employed in orthogonal frequency division multiplexing (OFDM) systems to mitigate peak-to-average power ratio. The utilization of this technique is widespread in electronic devices with limited power or resource capabilities due to its high efficiency and low complexity. While clipping effectively diminishes nonlinear distortion stemming from power amplifiers (PAs), it introduces additional distortion known as clipping distortion. The optimization of system performance, considering both clipping distortions and the nonlinearity of PAs, remains an unresolved challenge due to the intricate modeling of PAs. In this article, we undertake an analysis of PA nonlinearity utilizing the Bessel–Fourier PA model and simplify its power expression through intermodulation product analysis. We mathematically derive expressions for the receiver signal-to-noise ratio and system symbol error rate (SER) for nonlinear clipped OFDM systems. Using these derivations, we explore the optimal system configuration required to achieve the lower bound of SER in practical OFDM systems, taking into account both PA nonlinearity and clipping distortion. The results and methodologies presented in this article contribute to an improved comprehension of system-level optimization in nonlinear OFDM systems employing clipping technology.
{"title":"Nonlinear Multicarrier Transmitter System With Signal Clipping: Measurement, Analysis, and Optimization","authors":"Yuyang Du;Liang Hao;Yiming Lei;Qun Yang;Shiqi Xu","doi":"10.1109/JSYST.2024.3401148","DOIUrl":"10.1109/JSYST.2024.3401148","url":null,"abstract":"Signal clipping is a well-established method employed in orthogonal frequency division multiplexing (OFDM) systems to mitigate peak-to-average power ratio. The utilization of this technique is widespread in electronic devices with limited power or resource capabilities due to its high efficiency and low complexity. While clipping effectively diminishes nonlinear distortion stemming from power amplifiers (PAs), it introduces additional distortion known as clipping distortion. The optimization of system performance, considering both clipping distortions and the nonlinearity of PAs, remains an unresolved challenge due to the intricate modeling of PAs. In this article, we undertake an analysis of PA nonlinearity utilizing the Bessel–Fourier PA model and simplify its power expression through intermodulation product analysis. We mathematically derive expressions for the receiver signal-to-noise ratio and system symbol error rate (SER) for nonlinear clipped OFDM systems. Using these derivations, we explore the optimal system configuration required to achieve the lower bound of SER in practical OFDM systems, taking into account both PA nonlinearity and clipping distortion. The results and methodologies presented in this article contribute to an improved comprehension of system-level optimization in nonlinear OFDM systems employing clipping technology.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1426-1435"},"PeriodicalIF":4.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141198098","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}
This article deals with the asynchronous event-triggered passive consensus issue for two-time-scale semi-Markov jump multiagent systems in continuous-time domain against denial-of-service (DoS) attacks. The multiagent systems are modeled with two-time-scale structures and the parameter changes are assumed to follow semi-Markov jump processes. For multiagent systems with two-time-scale structures, singular perturbed approaches are introduced to separate the coupled slow and fast dynamics of each agent. Then, double-rate sampling mechanisms are adopted for slow and fast dynamics with different evolution rates, and a novel asynchronous event-triggered scheme (AETS) with two independent triggering conditions is proposed. The asynchronous event-triggered scheme based on double-rate sampled-data reduces the transmission of unnecessary data and saves limited bandwidth resources by triggering independently on two time-scales. In addition, a consensus strategy is proposed to assure the multiagent system of achieving consensus with a specified passive performance level. Finally, the simulation example verifies that the asynchronous event-triggered scheme saves about 50% of network resources than the synchronous scheme under the premise of the same control effect.
{"title":"Asynchronous Event-Triggered Passive Consensus of Semi-Markov Jump Multiagent Systems With Two-Time-Scale Feature Under DoS Attacks","authors":"Guanzheng Zhang;Ya-Nan Wang;Feng Li;Jing Wang;Hao Shen","doi":"10.1109/JSYST.2024.3400963","DOIUrl":"10.1109/JSYST.2024.3400963","url":null,"abstract":"This article deals with the asynchronous event-triggered passive consensus issue for two-time-scale semi-Markov jump multiagent systems in continuous-time domain against denial-of-service (DoS) attacks. The multiagent systems are modeled with two-time-scale structures and the parameter changes are assumed to follow semi-Markov jump processes. For multiagent systems with two-time-scale structures, singular perturbed approaches are introduced to separate the coupled slow and fast dynamics of each agent. Then, double-rate sampling mechanisms are adopted for slow and fast dynamics with different evolution rates, and a novel asynchronous event-triggered scheme (AETS) with two independent triggering conditions is proposed. The asynchronous event-triggered scheme based on double-rate sampled-data reduces the transmission of unnecessary data and saves limited bandwidth resources by triggering independently on two time-scales. In addition, a consensus strategy is proposed to assure the multiagent system of achieving consensus with a specified passive performance level. Finally, the simulation example verifies that the asynchronous event-triggered scheme saves about 50% of network resources than the synchronous scheme under the premise of the same control effect.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1277-1287"},"PeriodicalIF":4.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190829","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}
This article presents reconfigurable intelligent surface (RIS)-aided deep learning (DL)-based spectrum sensing for next-generation cognitive radios (CRs). To that end, the secondary user (SU) monitors the primary transmitter (PT) signal, where the RIS plays a pivotal role in increasing the strength of the PT signal at the SU. The spectrograms of the synthesized dataset, including the fourth-generation long-term evolution and fifth-generation new radio signals, are mapped to images utilized for training the state-of-the-art object detection approaches, namely, Detectron2 and YOLOv7. By conducting extensive experiments using a real RIS prototype, we demonstrate that the RIS can consistently and significantly improve the performance of the DL detectors to identify the PT signal type along with its time and frequency utilization. This study also paves the way for optimizing spectrum utilization through RIS-assisted CR application in next-generation wireless communication systems.
{"title":"Practical Implementation of RIS-Aided Spectrum Sensing: A Deep-Learning-Based Solution","authors":"Sefa Kayraklik;Ibrahim Yildirim;Ertugrul Basar;Ibrahim Hokelek;Ali Gorcin","doi":"10.1109/JSYST.2024.3376986","DOIUrl":"10.1109/JSYST.2024.3376986","url":null,"abstract":"This article presents reconfigurable intelligent surface (RIS)-aided deep learning (DL)-based spectrum sensing for next-generation cognitive radios (CRs). To that end, the secondary user (SU) monitors the primary transmitter (PT) signal, where the RIS plays a pivotal role in increasing the strength of the PT signal at the SU. The spectrograms of the synthesized dataset, including the fourth-generation long-term evolution and fifth-generation new radio signals, are mapped to images utilized for training the state-of-the-art object detection approaches, namely, Detectron2 and YOLOv7. By conducting extensive experiments using a real RIS prototype, we demonstrate that the RIS can consistently and significantly improve the performance of the DL detectors to identify the PT signal type along with its time and frequency utilization. This study also paves the way for optimizing spectrum utilization through RIS-assisted CR application in next-generation wireless communication systems.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1481-1488"},"PeriodicalIF":4.0,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140315228","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}
In recent years, the high expansion of independent energy sources and development of multiagent structures have resulted in new challenges in the efficient power management of distribution networks. In this regard, decentralized management along considering operational concerns of the system will be a key factor in running the future multiagent systems. Therefore, this article proposes a decentralized framework based on the alternating direction method of multipliers for managing the peer-to-peer (P2P) energy trading in a multiagent distribution system while considering the technical constraints and reliability of the network. This strategy facilitates considering the effects of the network reliability while running the agents’ optimization in a decentralized manner. Respectively, each agent would tend to exchange energy with more reliable agents, which would result in the resilient operation of the network. Moreover, the uncertainty of renewable energy sources is addressed using distributionally robust optimization. Additionally, with the aim of increasing the security of the P2P energy market against communication errors and agents’ misbehavior, an algorithm is developed to identify the existence of a problem in the market convergence as well as how it could be mitigated. Finally, this scheme is investigated on 37 and 69 bus test systems to study its capability in running sustainable energy systems.
{"title":"Decentralized Energy Management of Multiagent Distribution Systems Considering the Grid Reliability and Agent Misbehavior","authors":"Farshid Aghamohammadi;Ali Abbaspour;Hossein Saber;Sajjad Fattaheian-Dehkordi;Matti Lehtonen","doi":"10.1109/JSYST.2024.3369871","DOIUrl":"10.1109/JSYST.2024.3369871","url":null,"abstract":"In recent years, the high expansion of independent energy sources and development of multiagent structures have resulted in new challenges in the efficient power management of distribution networks. In this regard, decentralized management along considering operational concerns of the system will be a key factor in running the future multiagent systems. Therefore, this article proposes a decentralized framework based on the alternating direction method of multipliers for managing the peer-to-peer (P2P) energy trading in a multiagent distribution system while considering the technical constraints and reliability of the network. This strategy facilitates considering the effects of the network reliability while running the agents’ optimization in a decentralized manner. Respectively, each agent would tend to exchange energy with more reliable agents, which would result in the resilient operation of the network. Moreover, the uncertainty of renewable energy sources is addressed using distributionally robust optimization. Additionally, with the aim of increasing the security of the P2P energy market against communication errors and agents’ misbehavior, an algorithm is developed to identify the existence of a problem in the market convergence as well as how it could be mitigated. Finally, this scheme is investigated on 37 and 69 bus test systems to study its capability in running sustainable energy systems.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"905-916"},"PeriodicalIF":4.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10478176","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140198348","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：