Pub Date : 2025-02-06DOI: 10.1109/JSYST.2025.3532511
Wenfeng Hu;Yulong Jiang;Biao Luo;Tingwen Huang
This article analyzes the consensus of double-integrator multiagent systems subjected to constant disturbances. First, we propose a proportional–integral (PI)-based consensus protocol with a linear integrator, under which the system can achieve consensus without any steady-state error. By directly analyzing the closed-loop system matrix, a necessary and sufficient condition for parameter selection is derived. Subsequently, to overcome the phase lag defect of the linear integrator, we propose a new PI-based protocol with a split-path nonlinear integrator. The nonlinear consensus protocol can not only ensure that the system achieves asymptotic consensus, but also enhance the transient performance with respect to overshoot. Finally, some simulation comparisons are conducted to validate the effectiveness of the proposed protocols.
{"title":"Consensus of Double-Integrator Multiagent Systems Under Disturbances: Two Types of PI-Based Protocols","authors":"Wenfeng Hu;Yulong Jiang;Biao Luo;Tingwen Huang","doi":"10.1109/JSYST.2025.3532511","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3532511","url":null,"abstract":"This article analyzes the consensus of double-integrator multiagent systems subjected to constant disturbances. First, we propose a proportional–integral (PI)-based consensus protocol with a linear integrator, under which the system can achieve consensus without any steady-state error. By directly analyzing the closed-loop system matrix, a necessary and sufficient condition for parameter selection is derived. Subsequently, to overcome the phase lag defect of the linear integrator, we propose a new PI-based protocol with a split-path nonlinear integrator. The nonlinear consensus protocol can not only ensure that the system achieves asymptotic consensus, but also enhance the transient performance with respect to overshoot. Finally, some simulation comparisons are conducted to validate the effectiveness of the proposed protocols.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"87-95"},"PeriodicalIF":4.0,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637970","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 : 2025-02-03DOI: 10.1109/JSYST.2025.3527627
Jianquan Zhu;Haojiang Huang;Wenmeng Zhao;Qiyuan Zheng;Wenhao Liu;Jiajun Chen;Yuhao Luo
The growth of distributed renewable energy in microgrids (MGs) raises challenges in energy management and consumption. As an innovative approach, peer-to-peer (P2P) energy trading offers a promising solution to address these problems. In this article, we propose a bi-layer decentralized (BLD) optimization algorithm for P2P energy trading in multimicrogrids (MMG). Compared with traditional optimization algorithms that are single-layer decentralized (i.e., decentralizing solely at inter-MG trading and typically centralizing prosumers within the MG), the proposed algorithm achieves bi-layer decentralization (i.e., decentralization extends to both inter-MG and intra-MG trading). In this way, the BLD algorithm can significantly preserve the information privacy and decision independence of prosumers. In addition, the proposed algorithm can efficiently manage power flow in a decentralized manner at both layers, whereas existing decentralized algorithms frequently neglect this critical feature. Furthermore, an accelerated BLD (ABLD) algorithm is proposed to address time-consuming issues in this nested P2P trading for MMG. Numerical simulations on various test systems demonstrate the effectiveness of the proposed algorithm. The results indicate that the error of the proposed algorithm is below 0.1%. In addition, BLD requires 15602.03 s to converge with 560 prosumers, while ABLD only requires 228.05 s.
{"title":"Bi-Layer Decentralized Optimization Algorithm for Peer-to-Peer Energy Trading in Multimicrogrids","authors":"Jianquan Zhu;Haojiang Huang;Wenmeng Zhao;Qiyuan Zheng;Wenhao Liu;Jiajun Chen;Yuhao Luo","doi":"10.1109/JSYST.2025.3527627","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3527627","url":null,"abstract":"The growth of distributed renewable energy in microgrids (MGs) raises challenges in energy management and consumption. As an innovative approach, peer-to-peer (P2P) energy trading offers a promising solution to address these problems. In this article, we propose a bi-layer decentralized (BLD) optimization algorithm for P2P energy trading in multimicrogrids (MMG). Compared with traditional optimization algorithms that are single-layer decentralized (i.e., decentralizing solely at inter-MG trading and typically centralizing prosumers within the MG), the proposed algorithm achieves bi-layer decentralization (i.e., decentralization extends to both inter-MG and intra-MG trading). In this way, the BLD algorithm can significantly preserve the information privacy and decision independence of prosumers. In addition, the proposed algorithm can efficiently manage power flow in a decentralized manner at both layers, whereas existing decentralized algorithms frequently neglect this critical feature. Furthermore, an accelerated BLD (ABLD) algorithm is proposed to address time-consuming issues in this nested P2P trading for MMG. Numerical simulations on various test systems demonstrate the effectiveness of the proposed algorithm. The results indicate that the error of the proposed algorithm is below 0.1%. In addition, BLD requires 15602.03 s to converge with 560 prosumers, while ABLD only requires 228.05 s.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"282-293"},"PeriodicalIF":4.0,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645242","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 : 2025-02-03DOI: 10.1109/JSYST.2025.3528976
Weiwei Liu;Wenxuan Hu;Wei Jing;Lanxin Lei;Lingping Gao;Yong Liu
Autonomous vehicles trained through multiagent reinforcement learning (MARL) have shown impressive results in many driving scenarios. However, the performance of these trained policies can be impacted when faced with diverse driving styles and personalities, particularly in highly interactive situations. This is because conventional MARL algorithms usually operate under the assumption of fully cooperative behavior among all agents and focus on maximizing team rewards during training. To address this issue, we introduce the personality modeling network (PeMN), which includes a cooperation value function and personality parameters to model the varied interactions in high-interactive scenarios. The PeMN also enables the training of a background traffic flow with diverse behaviors, thereby improving the performance and generalization of the ego vehicle. Our extensive experimental studies, which incorporate different personality parameters in high-interactive driving scenarios, demonstrate that the personality parameters effectively model diverse driving styles and that policies trained with PeMN demonstrate better generalization than traditional MARL methods.
{"title":"Learning to Model Diverse Driving Behaviors in Highly Interactive Autonomous Driving Scenarios With Multiagent Reinforcement Learning","authors":"Weiwei Liu;Wenxuan Hu;Wei Jing;Lanxin Lei;Lingping Gao;Yong Liu","doi":"10.1109/JSYST.2025.3528976","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3528976","url":null,"abstract":"Autonomous vehicles trained through multiagent reinforcement learning (MARL) have shown impressive results in many driving scenarios. However, the performance of these trained policies can be impacted when faced with diverse driving styles and personalities, particularly in highly interactive situations. This is because conventional MARL algorithms usually operate under the assumption of fully cooperative behavior among all agents and focus on maximizing team rewards during training. To address this issue, we introduce the personality modeling network (PeMN), which includes a cooperation value function and personality parameters to model the varied interactions in high-interactive scenarios. The PeMN also enables the training of a background traffic flow with diverse behaviors, thereby improving the performance and generalization of the ego vehicle. Our extensive experimental studies, which incorporate different personality parameters in high-interactive driving scenarios, demonstrate that the personality parameters effectively model diverse driving styles and that policies trained with PeMN demonstrate better generalization than traditional MARL methods.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"317-326"},"PeriodicalIF":4.0,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645182","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 : 2025-01-31DOI: 10.1109/JSYST.2025.3528748
Elham Hojati;Alan Sill;Susan Mengel;Sayed Mohammad Bagher Sayedi;Argenis Bilbao;Konrad Schmitt
Maintaining service reliability, achieving sustainability, and ensuring energy efficiency are crucial for green high-performance computing systems. Balancing these factors is a key challenge for modern green data centers. In this research, we propose a monitoring, visualization, and management system for green data centers (MVMS-GDC). Our comprehensive automated platform includes “monitoring system” and “rules and policy management” modules. The “monitoring system” gathers and visualizes time series data from all resources of a green data center, tracking essential metrics and measurements. It audits green energy, microgrid, climate conditions, workloads, hardware, CPU and memory usage, cluster component health, computing node activities, and network health and quality metrics. The “rules and policy management” module defines and enforces policies to balance resources, ensuring a reliable, sustainable, scalable, and efficient computing environment. We implemented, tested, and evaluated the MVMS-GDC system using green energy at the Zephyr data center located at the GLEAMM site. Our results demonstrate at least a 4.9% improvement in performance, at least a 4% increase in energy efficiency, and a reduction of at least 4% in job losses. The MVMS-GDC system also enhances scalability by employing a policy machine for each compute node, which automates power state control (on, off, or hibernation) based on monitoring observations. This automated approach ensures efficient and dynamic scaling, making MVMS-GDC suitable for large and highly distributed data centers. Overall, MVMS-GDC provides a robust solution for balancing energy availability and computational needs, optimizing performance, and maintaining energy efficiency in green data centers.
{"title":"A Comprehensive Monitoring, Visualization, and Management System for Green Data Centers","authors":"Elham Hojati;Alan Sill;Susan Mengel;Sayed Mohammad Bagher Sayedi;Argenis Bilbao;Konrad Schmitt","doi":"10.1109/JSYST.2025.3528748","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3528748","url":null,"abstract":"Maintaining service reliability, achieving sustainability, and ensuring energy efficiency are crucial for green high-performance computing systems. Balancing these factors is a key challenge for modern green data centers. In this research, we propose a monitoring, visualization, and management system for green data centers (MVMS-GDC). Our comprehensive automated platform includes “monitoring system” and “rules and policy management” modules. The “monitoring system” gathers and visualizes time series data from all resources of a green data center, tracking essential metrics and measurements. It audits green energy, microgrid, climate conditions, workloads, hardware, CPU and memory usage, cluster component health, computing node activities, and network health and quality metrics. The “rules and policy management” module defines and enforces policies to balance resources, ensuring a reliable, sustainable, scalable, and efficient computing environment. We implemented, tested, and evaluated the MVMS-GDC system using green energy at the Zephyr data center located at the GLEAMM site. Our results demonstrate at least a 4.9% improvement in performance, at least a 4% increase in energy efficiency, and a reduction of at least 4% in job losses. The MVMS-GDC system also enhances scalability by employing a policy machine for each compute node, which automates power state control (<sc>on</small>, <sc>off</small>, or hibernation) based on monitoring observations. This automated approach ensures efficient and dynamic scaling, making MVMS-GDC suitable for large and highly distributed data centers. Overall, MVMS-GDC provides a robust solution for balancing energy availability and computational needs, optimizing performance, and maintaining energy efficiency in green data centers.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"119-129"},"PeriodicalIF":4.0,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645229","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 : 2025-01-29DOI: 10.1109/JSYST.2025.3529502
Liwen Weng;Zhitao Li;Lixin Gao
In the affine formation maneuver control for multiagent systems with a leader-follower structure, external disturbances easily cause deformation of the formation shape, thereby affecting a series of cascading reactions. Hence, robustness against disturbances in affine formation control has been a subject remaining to be determined. To address this problem, a continuous robust controller is introduced in this study, leveraging the robust integral of the sign of the error (RISE) approach, aiming to suppress external disturbances while ensuring efficient convergence speed of the system under various collective formation maneuvers determined by the leader. The controller is designed to handle two types of disturbance models: one involving general disturbances and the other considering time-delay disturbances. It consists of formation tracking terms based on stress matrices and graph theory, as well as disturbance suppression terms utilizing RISE. Sufficient conditions for the stability of affine formations under both types of disturbances are derived. By designing a Lyapunov function that integrates a class-P function, the exponential stability of the closed-loop system is rigorously demonstrated. Finally, simulation results are provided to verify the performance and effectiveness of the proposed control strategy.
在具有领导者-追随者结构的多代理系统的仿射编队操纵控制中，外部干扰很容易导致编队形状变形，从而影响一系列级联反应。因此，仿射编队控制中抗扰动的鲁棒性一直是一个有待确定的课题。针对这一问题，本研究利用误差符号的鲁棒积分（RISE）方法，引入了一种连续鲁棒控制器，旨在抑制外部干扰，同时确保系统在领导者决定的各种集体编队机动下的有效收敛速度。控制器设计用于处理两类干扰模型：一类涉及一般干扰，另一类考虑时延干扰。它包括基于应力矩阵和图论的编队跟踪项，以及利用 RISE 的干扰抑制项。推导出了两种干扰下仿射编队稳定性的充分条件。通过设计一个整合 P 类函数的 Lyapunov 函数，闭环系统的指数稳定性得到了严格证明。最后，还提供了仿真结果，以验证所提控制策略的性能和有效性。
{"title":"Affine Formation Maneuver Control of Multiagent Systems With Disturbances Based on RISE Controller","authors":"Liwen Weng;Zhitao Li;Lixin Gao","doi":"10.1109/JSYST.2025.3529502","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3529502","url":null,"abstract":"In the affine formation maneuver control for multiagent systems with a leader-follower structure, external disturbances easily cause deformation of the formation shape, thereby affecting a series of cascading reactions. Hence, robustness against disturbances in affine formation control has been a subject remaining to be determined. To address this problem, a continuous robust controller is introduced in this study, leveraging the robust integral of the sign of the error (RISE) approach, aiming to suppress external disturbances while ensuring efficient convergence speed of the system under various collective formation maneuvers determined by the leader. The controller is designed to handle two types of disturbance models: one involving general disturbances and the other considering time-delay disturbances. It consists of formation tracking terms based on stress matrices and graph theory, as well as disturbance suppression terms utilizing RISE. Sufficient conditions for the stability of affine formations under both types of disturbances are derived. By designing a Lyapunov function that integrates a class-P function, the exponential stability of the closed-loop system is rigorously demonstrated. Finally, simulation results are provided to verify the performance and effectiveness of the proposed control strategy.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"142-151"},"PeriodicalIF":4.0,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637865","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 : 2025-01-29DOI: 10.1109/JSYST.2025.3529720
Alireza Meidani;Moein Abedini;Majid Sanaye-Pasand
The security of distance relays in zone 3 is critical for preventing catastrophic blackouts, especially during stressed conditions. However, the challenge lies in distinguishing between short-circuit faults and system disturbances, e.g., load encroachment, power swing, out-of-step condition, and voltage instability, which can mimic fault conditions and lead to improper relay operation. To address this issue, this article presents a new local protection method by employing three innovative indices: the out-of-step detection index, the positive-sequence impedance angle (PSIA) index, and the superimposed PSIA index. These indices are derived from theoretical principles and are tailored to effectively discriminate between faults and system disturbances. As a major novelty, the determination of indices threshold values is extracted based on the theoretical relationships and further validated through comprehensive static and dynamic analyses. The algorithm's effectiveness is evaluated under various stressed conditions through multiple simulations, showing its ability to distinguish between stressed conditions and short-circuit faults, even in the presence of inverter-based resources. This leads to enhanced power system reliability and security. The proposed method is also cost-effective as it is implemented in the local distance relay, eliminating the need for synchrophasor devices and communication infrastructure.
{"title":"Enhancing Performance of Distance Relay Zone 3 Under Stressed Conditions Using an Angle-Based Algorithm","authors":"Alireza Meidani;Moein Abedini;Majid Sanaye-Pasand","doi":"10.1109/JSYST.2025.3529720","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3529720","url":null,"abstract":"The security of distance relays in zone 3 is critical for preventing catastrophic blackouts, especially during stressed conditions. However, the challenge lies in distinguishing between short-circuit faults and system disturbances, e.g., load encroachment, power swing, out-of-step condition, and voltage instability, which can mimic fault conditions and lead to improper relay operation. To address this issue, this article presents a new local protection method by employing three innovative indices: the out-of-step detection index, the positive-sequence impedance angle (PSIA) index, and the superimposed PSIA index. These indices are derived from theoretical principles and are tailored to effectively discriminate between faults and system disturbances. As a major novelty, the determination of indices threshold values is extracted based on the theoretical relationships and further validated through comprehensive static and dynamic analyses. The algorithm's effectiveness is evaluated under various stressed conditions through multiple simulations, showing its ability to distinguish between stressed conditions and short-circuit faults, even in the presence of inverter-based resources. This leads to enhanced power system reliability and security. The proposed method is also cost-effective as it is implemented in the local distance relay, eliminating the need for synchrophasor devices and communication infrastructure.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"270-281"},"PeriodicalIF":4.0,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645231","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 : 2025-01-29DOI: 10.1109/JSYST.2025.3534536
{"title":"List of Reviewers 2024","authors":"","doi":"10.1109/JSYST.2025.3534536","DOIUrl":"https://doi.org/10.1109/JSYST.2025.3534536","url":null,"abstract":"","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"3-6"},"PeriodicalIF":4.0,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10857644","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637972","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 : 2025-01-22DOI: 10.1109/JSYST.2024.3524880
Mahmoud A. Albreem;Alaa H. Al Habbash;Ammar M. Abu-Hudrouss;M.-T. EL Astal
The design of low-complexity data detection techniques for massive multiple-input multiple-output (mMIMO) systems continues to attract considerable industry and research attention due to the critical need to achieve the right tradeoff between complexity and performance, especially with the signed quadrature spatial modulation (SQSM) scheme. However, the SQSM scheme attains a high spectral efficiency and good performance but suffers from a high computational complexity with mMIMO systems. In this article, we propose an efficient low-complexity detection framework for the SQSM scheme. Sparsity detection is amalgamated in this article with minimum mean-square error (MMSE) detector by decoupling the detection of the real and imaginary vector streams. Unfortunately, the MMSE-based detector has a matrix inversion which incurs a high computational complexity. Therefore, we employed several iterative methods; i.e., conjugate gradient and Gauss–Seidel, to avoid the exact matrix inversion, and hence, the computational complexity is significantly reduced. Moreover, the proposed framework can host other iterative methods such as the JA, successive over relaxation, accelerated over relaxation, Neumann series, Newton iteration, two-parameter over relaxation, and Richardson methods. The proposed detection framework attains a significant complexity reduction with a small or insignificant deterioration in the performance.
{"title":"A Low-Complexity Detection Framework for Signed Quadrature Spatial Modulation Based on Approximated MMSE Sparse Detectors","authors":"Mahmoud A. Albreem;Alaa H. Al Habbash;Ammar M. Abu-Hudrouss;M.-T. EL Astal","doi":"10.1109/JSYST.2024.3524880","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3524880","url":null,"abstract":"The design of low-complexity data detection techniques for massive multiple-input multiple-output (mMIMO) systems continues to attract considerable industry and research attention due to the critical need to achieve the right tradeoff between complexity and performance, especially with the signed quadrature spatial modulation (SQSM) scheme. However, the SQSM scheme attains a high spectral efficiency and good performance but suffers from a high computational complexity with mMIMO systems. In this article, we propose an efficient low-complexity detection framework for the SQSM scheme. Sparsity detection is amalgamated in this article with minimum mean-square error (MMSE) detector by decoupling the detection of the real and imaginary vector streams. Unfortunately, the MMSE-based detector has a matrix inversion which incurs a high computational complexity. Therefore, we employed several iterative methods; i.e., conjugate gradient and Gauss–Seidel, to avoid the exact matrix inversion, and hence, the computational complexity is significantly reduced. Moreover, the proposed framework can host other iterative methods such as the JA, successive over relaxation, accelerated over relaxation, Neumann series, Newton iteration, two-parameter over relaxation, and Richardson methods. The proposed detection framework attains a significant complexity reduction with a small or insignificant deterioration in the performance.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"32-42"},"PeriodicalIF":4.0,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637909","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 : 2025-01-14DOI: 10.1109/JSYST.2024.3524624
Weiyi Ni;Hailin Xiao;Xiaolan Liu;Anthony Theodore Chronopoulos;Petros A. Ioannou
A large number of devices communicating through the backhaul links in heterogeneous cellular networks (HetCNets) will incur severe traffic congestion, high delay, and huge energy consumption. Enabling caching capabilities has been regarded as a promising way to reduce the high-delay pressure of file delivery on the backhaul links. However, file delivery has different requirements on quality-of-service, and the increased densification of small base stations will consume more energy, thus it is essential to solve the problem of delay and energy in cache-enabled HetCNets. In this article, we employ a utility function with the weighted sum of energy consumption and delay cost to formulate the delay-energy tradeoff optimization problem that is a kind of multiobjective optimization problem. Considering a jointly performed mechanism comprising power control, user association, and content caching, the optimization problem is further decomposed into the primal problem and the main problem by generalized Benders decomposition method. Here, the primal problem is related to power-aware user association that dynamically associates with the base station, and the main problem is related to content caching. Furthermore, an iterative power-aware user association and content caching algorithm (PAUA-CC) is proposed. Finally, we present numerical simulation results to demonstrate the effectiveness of our proposed approach on the optimal delay-energy tradeoff.
{"title":"Power-Aware User Association and Content Caching Algorithm for Delay-Energy Tradeoff in Cache-Enabled Heterogeneous Cellular Networks","authors":"Weiyi Ni;Hailin Xiao;Xiaolan Liu;Anthony Theodore Chronopoulos;Petros A. Ioannou","doi":"10.1109/JSYST.2024.3524624","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3524624","url":null,"abstract":"A large number of devices communicating through the backhaul links in heterogeneous cellular networks (HetCNets) will incur severe traffic congestion, high delay, and huge energy consumption. Enabling caching capabilities has been regarded as a promising way to reduce the high-delay pressure of file delivery on the backhaul links. However, file delivery has different requirements on quality-of-service, and the increased densification of small base stations will consume more energy, thus it is essential to solve the problem of delay and energy in cache-enabled HetCNets. In this article, we employ a utility function with the weighted sum of energy consumption and delay cost to formulate the delay-energy tradeoff optimization problem that is a kind of multiobjective optimization problem. Considering a jointly performed mechanism comprising power control, user association, and content caching, the optimization problem is further decomposed into the primal problem and the main problem by generalized Benders decomposition method. Here, the primal problem is related to power-aware user association that dynamically associates with the base station, and the main problem is related to content caching. Furthermore, an iterative power-aware user association and content caching algorithm (PAUA-CC) is proposed. Finally, we present numerical simulation results to demonstrate the effectiveness of our proposed approach on the optimal delay-energy tradeoff.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"246-257"},"PeriodicalIF":4.0,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645230","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 : 2025-01-10DOI: 10.1109/JSYST.2024.3523485
Zirui Liao;Jian Shi;Yuwei Zhang;Shaoping Wang;Rentong Chen;Zhiyong Sun
This article addresses the resilient rendezvous problem for leader–follower multiagent systems (MASs) in the presence of adversarial attacks. A novel leader–follower attack-tolerant (LFAT) algorithm is developed to ensure that the healthy followers reach rendezvous on the reference value propagated by healthy leaders. Compared with the existing weighted mean-subsequence-reduced algorithm, the proposed LFAT algorithm includes a necessary state initialization step for leader and follower agents and an improved threat elimination step, so that more effective information can be retained for state updates. The necessary and sufficient condition on the network topology is further derived to ensure resilient rendezvous for leader–follower MASs. Compared with the existing resilient algorithms, the proposed LFAT algorithm enables MASs to achieve leader–follower resilient rendezvous under relaxed graph robustness conditions, so that the network redundancy is mitigated. Several numerical examples are given to illustrate the superior performance of the LFAT algorithm and the scalability to larger-scale and time-varying networks.
{"title":"A Leader–Follower Attack-Tolerant Algorithm for Resilient Rendezvous With Reduced Network Redundancy","authors":"Zirui Liao;Jian Shi;Yuwei Zhang;Shaoping Wang;Rentong Chen;Zhiyong Sun","doi":"10.1109/JSYST.2024.3523485","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3523485","url":null,"abstract":"This article addresses the resilient rendezvous problem for leader–follower multiagent systems (MASs) in the presence of adversarial attacks. A novel leader–follower attack-tolerant (LFAT) algorithm is developed to ensure that the healthy followers reach rendezvous on the reference value propagated by healthy leaders. Compared with the existing weighted mean-subsequence-reduced algorithm, the proposed LFAT algorithm includes a necessary state initialization step for leader and follower agents and an improved threat elimination step, so that more effective information can be retained for state updates. The necessary and sufficient condition on the network topology is further derived to ensure resilient rendezvous for leader–follower MASs. Compared with the existing resilient algorithms, the proposed LFAT algorithm enables MASs to achieve leader–follower resilient rendezvous under relaxed graph robustness conditions, so that the network redundancy is mitigated. Several numerical examples are given to illustrate the superior performance of the LFAT algorithm and the scalability to larger-scale and time-varying networks.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"212-223"},"PeriodicalIF":4.0,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637950","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：