Pub Date : 2024-03-15DOI: 10.1109/JSYST.2024.3393232
Bin Liao;Yutong Wang;Jiapeng Xue;Zhenyu Zhou;Sunxuan Zhang;Xiaomei Chen
Power Internet of Things devices deployed in smart parks have strict time synchronization requirements. However, due to the limited availability of 4-G/5-G, optical fiber, and satellite, how to achieve low-cost, reliable, and efficient time synchronization based on existing power line carrier (PLC) and two-way power frequency automatic communication system (TWACS) integrated multimodal communication has become a key challenge. Motivated by this, a cluster-based time synchronization network structure is proposed that seamlessly integrates PLC and TWACS, which provides an accurate synchronization model by comprehensively considering frequency offset, timestamp recorded error, timestamp jitter error, and transmission delay. Moreover, we incorporate digital phase-locked loop to compensate synchronization error by correcting frequency offset in clusters. The goal is to realize the minimization of the average time synchronization error within clusters. To achieve this goal, we introduce a coalition formation game-based dynamic clustering algorithm (CFG-DC), designed to effectively address the proposed optimization challenge. CFG-DC achieves dynamic clustering with consideration of time synchronization error awareness by performing leave-and-join decision iteratively to maximize synchronization error-based utility function. Simulation distinctly demonstrate the remarkable achievement of CFG-DC in attaining heightened levels of accuracy in time synchronization.
{"title":"Dynamic Clustering-Based Time Synchronization for PLC-TWACS Integrated Multimodal Power IoT in Smart Park","authors":"Bin Liao;Yutong Wang;Jiapeng Xue;Zhenyu Zhou;Sunxuan Zhang;Xiaomei Chen","doi":"10.1109/JSYST.2024.3393232","DOIUrl":"10.1109/JSYST.2024.3393232","url":null,"abstract":"Power Internet of Things devices deployed in smart parks have strict time synchronization requirements. However, due to the limited availability of 4-G/5-G, optical fiber, and satellite, how to achieve low-cost, reliable, and efficient time synchronization based on existing power line carrier (PLC) and two-way power frequency automatic communication system (TWACS) integrated multimodal communication has become a key challenge. Motivated by this, a cluster-based time synchronization network structure is proposed that seamlessly integrates PLC and TWACS, which provides an accurate synchronization model by comprehensively considering frequency offset, timestamp recorded error, timestamp jitter error, and transmission delay. Moreover, we incorporate digital phase-locked loop to compensate synchronization error by correcting frequency offset in clusters. The goal is to realize the minimization of the average time synchronization error within clusters. To achieve this goal, we introduce a coalition formation game-based dynamic clustering algorithm (CFG-DC), designed to effectively address the proposed optimization challenge. CFG-DC achieves dynamic clustering with consideration of time synchronization error awareness by performing leave-and-join decision iteratively to maximize synchronization error-based utility function. Simulation distinctly demonstrate the remarkable achievement of CFG-DC in attaining heightened levels of accuracy in time synchronization.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1296-1307"},"PeriodicalIF":4.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141058603","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-12DOI: 10.1109/JSYST.2024.3365801
Gabriel Intriago;Andres Intriago;Charalambos Konstantinou;Yu Zhang
Fault detection (FD) is vital in ensuring ac microgrids' reliable and resilient operation. Its importance lies in swiftly identifying and isolating faults, preventing cascading failures, and enabling rapid power restoration. This article proposes a strategy based on observers and residuals for detecting internal faults in grid-forming inverters with power-sharing coordination. The dynamics of the inverters are captured through a nonlinear state-space model. The design of our observers and residuals considers $H_{-}/H_{infty }$ conditions to ensure robustness against disturbances and responsiveness to faults. The proposed design is less restrictive than existing observer-based FD schemes by leveraging the properties of quadratic inner-boundedness and one-sided Lipschitz conditions. The internal faults considered in this article include actuator faults, busbar faults, and inverter bridge faults, which are modeled using vector–matrix representations that modify the state-space model of the inverters. One significant advantage of the proposed approach is its cost-effectiveness, as it does not require additional sensors. Experiments are conducted on an islanded ac microgrid with three inductive lines, four inductive loads, and four grid-forming inverters to validate the merits of the proposed FD strategy. The results demonstrate that our design outperforms existing methods in the field.
{"title":"A Novel Observer-Centric Approach for Detecting Faults in Islanded AC Microgrids With Uncertainties","authors":"Gabriel Intriago;Andres Intriago;Charalambos Konstantinou;Yu Zhang","doi":"10.1109/JSYST.2024.3365801","DOIUrl":"10.1109/JSYST.2024.3365801","url":null,"abstract":"Fault detection (FD) is vital in ensuring ac microgrids' reliable and resilient operation. Its importance lies in swiftly identifying and isolating faults, preventing cascading failures, and enabling rapid power restoration. This article proposes a strategy based on observers and residuals for detecting internal faults in grid-forming inverters with power-sharing coordination. The dynamics of the inverters are captured through a nonlinear state-space model. The design of our observers and residuals considers \u0000<inline-formula><tex-math>$H_{-}/H_{infty }$</tex-math></inline-formula>\u0000 conditions to ensure robustness against disturbances and responsiveness to faults. The proposed design is less restrictive than existing observer-based FD schemes by leveraging the properties of quadratic inner-boundedness and one-sided Lipschitz conditions. The internal faults considered in this article include actuator faults, busbar faults, and inverter bridge faults, which are modeled using vector–matrix representations that modify the state-space model of the inverters. One significant advantage of the proposed approach is its cost-effectiveness, as it does not require additional sensors. Experiments are conducted on an islanded ac microgrid with three inductive lines, four inductive loads, and four grid-forming inverters to validate the merits of the proposed FD strategy. The results demonstrate that our design outperforms existing methods in the field.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1236-1247"},"PeriodicalIF":4.0,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140115316","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 secure backscatter transmission against a multiantenna eavesdropper in a symbiotic radio (SR) system, where a single-antenna backscatter device (BD) can transmit confidential information to a primary receiver via a multiantenna primary transmitter's signal. The primary receiver jointly decodes the received signals. The aim is to ensure secure communication for BD while meeting the quality of service (QoS) requirements of the primary system. This article investigates two practical SR systems based on the eavesdropper's available channel state information (CSI). First, when the full CSI is known, an alternating optimization algorithm is proposed that maximizes the achievable secrecy rate of BD by jointly optimizing primary transmit beamforming and power sharing between information and artificial noise (AN) signals. Second, when no eavesdropper CSI is available, it is impossible to determine a secrecy rate expression. Consequently, secrecy communication is achieved by an AN-assisted optimal beamforming scheme where a minimum transmit power is used to meet the QoS constraints of the primary and backscatter systems before utilizing the remaining power for random AN to jam the eavesdropper. Successive convex approximation-based solutions are also obtained for comparison. Simulations verify the key analytical claims, provide nontrivial design insights, and quantify the achievable gains over the relevant benchmarks.
{"title":"QoS Awareness Transmit Beamforming for Secure Backscattering in Symbiotic Radio Networks","authors":"Mingcheng Nie;Deepak Mishra;Azzam Al-nahari;Jinhong Yuan;Riku Jäntti","doi":"10.1109/JSYST.2024.3396176","DOIUrl":"10.1109/JSYST.2024.3396176","url":null,"abstract":"This article presents secure backscatter transmission against a multiantenna eavesdropper in a symbiotic radio (SR) system, where a single-antenna backscatter device (BD) can transmit confidential information to a primary receiver via a multiantenna primary transmitter's signal. The primary receiver jointly decodes the received signals. The aim is to ensure secure communication for BD while meeting the quality of service (QoS) requirements of the primary system. This article investigates two practical SR systems based on the eavesdropper's available channel state information (CSI). First, when the full CSI is known, an alternating optimization algorithm is proposed that maximizes the achievable secrecy rate of BD by jointly optimizing primary transmit beamforming and power sharing between information and artificial noise (AN) signals. Second, when no eavesdropper CSI is available, it is impossible to determine a secrecy rate expression. Consequently, secrecy communication is achieved by an AN-assisted optimal beamforming scheme where a minimum transmit power is used to meet the QoS constraints of the primary and backscatter systems before utilizing the remaining power for random AN to jam the eavesdropper. Successive convex approximation-based solutions are also obtained for comparison. Simulations verify the key analytical claims, provide nontrivial design insights, and quantify the achievable gains over the relevant benchmarks.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1356-1367"},"PeriodicalIF":4.0,"publicationDate":"2024-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939486","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-10DOI: 10.1109/JSYST.2024.3396231
Xiaoxia Huang;Peng Guo;Ding Wang;Xiaonan Wang;Chengbin Sun
In the supply chain network frequently facing disruption risk, sustaining a high reputation is essential for ensuring long-term sustainability. While existing studies have investigated how reputation evidence influences the overall network structure and cooperative behaviors, they have not extensively examined how variations in reputation evidence affect cooperative dynamics in the bipartite graph consisting of upstream and downstream enterprises. To bridge this gap, our research introduces a novel, reputation-based approach utilizing evidential reasoning theory to assess dynamic environments prone to disruption risk. This improved approach assigns specific weights and reliability to reputation evidence. In this article, we analyze the evolution of cooperation between upstream and downstream enterprises in the supply chain, considering varied distributions of reputation evidence. We also conduct numerical simulations to evaluate the impact of these reputation distributions on the cooperative evolution of the supply chain network under diverse disruption scenarios, including both direct and indirect risks. Our findings offer insightful guidance for managers to refine their reputation distribution strategies, effectively navigate different disruption risk scenarios, and lessen negative impacts on cooperation. Moreover, our study provides significant implications for partner selection and managing disruption risk in a dynamic and uncertain supply chain network.
{"title":"Reputation-Based Evidential Reasoning Approach Improves Cooperative Evolution of Supply Chain Network Under Disruption Risk","authors":"Xiaoxia Huang;Peng Guo;Ding Wang;Xiaonan Wang;Chengbin Sun","doi":"10.1109/JSYST.2024.3396231","DOIUrl":"10.1109/JSYST.2024.3396231","url":null,"abstract":"In the supply chain network frequently facing disruption risk, sustaining a high reputation is essential for ensuring long-term sustainability. While existing studies have investigated how reputation evidence influences the overall network structure and cooperative behaviors, they have not extensively examined how variations in reputation evidence affect cooperative dynamics in the bipartite graph consisting of upstream and downstream enterprises. To bridge this gap, our research introduces a novel, reputation-based approach utilizing evidential reasoning theory to assess dynamic environments prone to disruption risk. This improved approach assigns specific weights and reliability to reputation evidence. In this article, we analyze the evolution of cooperation between upstream and downstream enterprises in the supply chain, considering varied distributions of reputation evidence. We also conduct numerical simulations to evaluate the impact of these reputation distributions on the cooperative evolution of the supply chain network under diverse disruption scenarios, including both direct and indirect risks. Our findings offer insightful guidance for managers to refine their reputation distribution strategies, effectively navigate different disruption risk scenarios, and lessen negative impacts on cooperation. Moreover, our study provides significant implications for partner selection and managing disruption risk in a dynamic and uncertain supply chain network.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"848-859"},"PeriodicalIF":4.0,"publicationDate":"2024-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939217","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-09DOI: 10.1109/JSYST.2024.3395845
Qiang Tang;Sihao Wen;Shiming He;Kun Yang
To address the performance limitations caused by the insufficient computing capacity and energy of edge internet of things devices (IoTDs), we proposed a multi-unmanned aerial vehicles (UAV)-assisted mobile edge computing (MEC) application framework in this article. In this framework, UAVs equipped with high-performance computing devices act as aerial servers deployed in the target area to support data offloading and task computing for IoTDs. We formulated an optimization problem to jointly optimize the connection scheduling, computing resource allocation, and UAVs' flying trajectories, considering the device offloading priority, to achieve a joint optimization of energy consumption and latency for all IoTDs during a given time period. Subsequently, to address this problem, we employed deep reinforcement learning for dynamic trajectory planning, supplemented by optimization theory and heuristic algorithm based on matching theory to assist in solving connection scheduling and computing resource allocation. To evaluate the performance of proposed algorithm, we compared it with deep deterministic policy gradient, particle swarm optimization, random moving, and local execution schemes. Simulation results demonstrated that the multi-UAV-assisted MEC significantly reduces the computing cost of IoTDs. Moreover, our proposed solution exhibited effectiveness in terms of convergence and optimization of computing costs compared to other benchmark schemes.
{"title":"Multi-UAV-Assisted Offloading for Joint Optimization of Energy Consumption and Latency in Mobile Edge Computing","authors":"Qiang Tang;Sihao Wen;Shiming He;Kun Yang","doi":"10.1109/JSYST.2024.3395845","DOIUrl":"10.1109/JSYST.2024.3395845","url":null,"abstract":"To address the performance limitations caused by the insufficient computing capacity and energy of edge internet of things devices (IoTDs), we proposed a multi-unmanned aerial vehicles (UAV)-assisted mobile edge computing (MEC) application framework in this article. In this framework, UAVs equipped with high-performance computing devices act as aerial servers deployed in the target area to support data offloading and task computing for IoTDs. We formulated an optimization problem to jointly optimize the connection scheduling, computing resource allocation, and UAVs' flying trajectories, considering the device offloading priority, to achieve a joint optimization of energy consumption and latency for all IoTDs during a given time period. Subsequently, to address this problem, we employed deep reinforcement learning for dynamic trajectory planning, supplemented by optimization theory and heuristic algorithm based on matching theory to assist in solving connection scheduling and computing resource allocation. To evaluate the performance of proposed algorithm, we compared it with deep deterministic policy gradient, particle swarm optimization, random moving, and local execution schemes. Simulation results demonstrated that the multi-UAV-assisted MEC significantly reduces the computing cost of IoTDs. Moreover, our proposed solution exhibited effectiveness in terms of convergence and optimization of computing costs compared to other benchmark schemes.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1414-1425"},"PeriodicalIF":4.0,"publicationDate":"2024-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939216","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-07DOI: 10.1109/JSYST.2024.3391856
Ishaan Sharma;Rohit Kumar;Sumit J. Darak
The evolution of software-defined radios and reconfigurable intelligent surfaces (RIS) has enabled on-the-fly control and reconfigurability at the physical layer parameters and radio propagation environment. In multi-RIS-aided communication, the RIS block, comprising a certain number of RIS elements from one or more RIS, is selected to achieve high throughput reliable communication between transmitter and receiver. However, selecting an RIS block when there are multiple RIS and receivers is not trivial due to the large number of candidate blocks. In this article, a novel multiarmed bandit (MAB) framework, which can learn and select the optimal RIS block using focused exploration, is proposed. We provide the theoretical regret bound for the proposed algorithm and demonstrate the gain in performance over existing state-of-the-art statistical and MAB approaches via detailed simulation results in terms of rate, ergodic capacity, outage probability, energy efficiency, and received SNR. The proposed algorithm offers 33%–85% lower latency than existing MAB algorithms on various edge platforms. Furthermore, the gain in performance and latency improves with the increase in the number and size of the RIS in the network.
{"title":"Online-Learning-Based Multi-RIS-Aided Wireless Systems","authors":"Ishaan Sharma;Rohit Kumar;Sumit J. Darak","doi":"10.1109/JSYST.2024.3391856","DOIUrl":"10.1109/JSYST.2024.3391856","url":null,"abstract":"The evolution of software-defined radios and reconfigurable intelligent surfaces (RIS) has enabled on-the-fly control and reconfigurability at the physical layer parameters and radio propagation environment. In multi-RIS-aided communication, the RIS block, comprising a certain number of RIS elements from one or more RIS, is selected to achieve high throughput reliable communication between transmitter and receiver. However, selecting an RIS block when there are multiple RIS and receivers is not trivial due to the large number of candidate blocks. In this article, a novel multiarmed bandit (MAB) framework, which can learn and select the optimal RIS block using focused exploration, is proposed. We provide the theoretical regret bound for the proposed algorithm and demonstrate the gain in performance over existing state-of-the-art statistical and MAB approaches via detailed simulation results in terms of rate, ergodic capacity, outage probability, energy efficiency, and received SNR. The proposed algorithm offers 33%–85% lower latency than existing MAB algorithms on various edge platforms. Furthermore, the gain in performance and latency improves with the increase in the number and size of the RIS in the network.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1174-1185"},"PeriodicalIF":4.0,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939215","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-06DOI: 10.1109/JSYST.2024.3370613
Raed Mesleh;Sahel Alouneh;Omar Hiari
A computationally secure physical layer wireless communication multiple-input–multiple-output (MIMO) system is proposed and analyzed in this article. The proposed algorithm is shown to be general for arbitrary MIMO systems, and very robust against brute–force attacks and cryptanalysis techniques. The algorithm relies on the knowledge of the wireless channel statistics between the transmitter and the legitimate receiver through channel reciprocity, which is random and varies every coherence time. Both the transmitter and the legitimate receiver create a permutation vector from the sorted powers of the channel fading paths from each transmit antenna to all receive antennas. The generated permutation vector is used to shuffle the rows of the constellation matrix creating the security key. It is reported that the number of possible combinations is huge, especially for large MIMO configurations, which makes key decryption nearly impossible even with advanced supercomputers. For illustration purposes, several MIMO techniques are considered in this study, including space shift keying (SSK), quadrature SSK, quadrature spatial modulation, and spatial multiplexing.
本文提出并分析了一种计算安全的物理层无线通信多输入多输出（MIMO）系统。研究表明，所提出的算法适用于任意 MIMO 系统，对暴力破解攻击和密码分析技术具有很强的抵抗力。该算法依赖于发射机和合法接收机之间通过信道互易性获得的无线信道统计信息。发射器和合法接收器都会根据从每个发射天线到所有接收天线的信道衰落路径的排序功率创建一个置换向量。生成的置换向量用于洗牌星座矩阵的行，从而创建安全密钥。据报道，可能的组合数量非常大，尤其是对于大型多输入多输出（MIMO）配置而言，即使使用先进的超级计算机，也几乎不可能解密密钥。为了说明问题，本研究考虑了几种多输入多输出技术，包括空间移动键控（SSK）、正交 SSK、正交空间调制和空间多路复用。
{"title":"Computational Secure Physical Layer Algorithm for MIMO Wireless Systems","authors":"Raed Mesleh;Sahel Alouneh;Omar Hiari","doi":"10.1109/JSYST.2024.3370613","DOIUrl":"10.1109/JSYST.2024.3370613","url":null,"abstract":"A computationally secure physical layer wireless communication multiple-input–multiple-output (MIMO) system is proposed and analyzed in this article. The proposed algorithm is shown to be general for arbitrary MIMO systems, and very robust against brute–force attacks and cryptanalysis techniques. The algorithm relies on the knowledge of the wireless channel statistics between the transmitter and the legitimate receiver through channel reciprocity, which is random and varies every coherence time. Both the transmitter and the legitimate receiver create a permutation vector from the sorted powers of the channel fading paths from each transmit antenna to all receive antennas. The generated permutation vector is used to shuffle the rows of the constellation matrix creating the security key. It is reported that the number of possible combinations is huge, especially for large MIMO configurations, which makes key decryption nearly impossible even with advanced supercomputers. For illustration purposes, several MIMO techniques are considered in this study, including space shift keying (SSK), quadrature SSK, quadrature spatial modulation, and spatial multiplexing.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"805-813"},"PeriodicalIF":4.0,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140054929","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-05DOI: 10.1109/JSYST.2024.3365848
Xue Li;Renqing Zhu;Dajun Du;Cheng Jiang;Zhe Zhou
The signcryption schemes play an important role in keeping the security of information interactions among the devices in cyber-physical power systems (CPPSs). However, the existing schemes based on bilinear pairing have heavy computation and communication costs, making it challenging to deploy to resource-constrained devices (RCDs). Moreover, the most existing aggregate signcryption schemes do not validate the signcryption ciphertext when the data are aggregated by the aggregation device, jeopardizing the security and stability of the CPPSs. To solve these issues, this article explores a novel certificateless aggregate signcryption scheme based on elliptic curve cryptography applied to information interaction among RCDs of CPPSs. First, a lightweight signcryption scheme is proposed to achieve secure information interaction of RCDs. Then, to efficiently discover illegal signcryption in the aggregate signcryption, a method of constructing a 2-D matrix is proposed, which improves the robustness of secure information interaction. Furthermore, the security of the proposed signcryption scheme is theoretically proven by the elliptic curve discrete logarithm problem and computational Diffie–Hellman problem assumptions, and the scheme is theoretically analyzed to meet the security requirements of RCDs. Finally, experiments are carried out to validate the efficacy and appropriateness of the proposed signcryption scheme.
{"title":"ECC-Based Certificateless Aggregate Signcryption Scheme in Cyber-Physical Power Systems","authors":"Xue Li;Renqing Zhu;Dajun Du;Cheng Jiang;Zhe Zhou","doi":"10.1109/JSYST.2024.3365848","DOIUrl":"10.1109/JSYST.2024.3365848","url":null,"abstract":"The signcryption schemes play an important role in keeping the security of information interactions among the devices in cyber-physical power systems (CPPSs). However, the existing schemes based on bilinear pairing have heavy computation and communication costs, making it challenging to deploy to resource-constrained devices (RCDs). Moreover, the most existing aggregate signcryption schemes do not validate the signcryption ciphertext when the data are aggregated by the aggregation device, jeopardizing the security and stability of the CPPSs. To solve these issues, this article explores a novel certificateless aggregate signcryption scheme based on elliptic curve cryptography applied to information interaction among RCDs of CPPSs. First, a lightweight signcryption scheme is proposed to achieve secure information interaction of RCDs. Then, to efficiently discover illegal signcryption in the aggregate signcryption, a method of constructing a 2-D matrix is proposed, which improves the robustness of secure information interaction. Furthermore, the security of the proposed signcryption scheme is theoretically proven by the elliptic curve discrete logarithm problem and computational Diffie–Hellman problem assumptions, and the scheme is theoretically analyzed to meet the security requirements of RCDs. Finally, experiments are carried out to validate the efficacy and appropriateness of the proposed signcryption scheme.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"893-904"},"PeriodicalIF":4.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140045247","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-04DOI: 10.1109/JSYST.2024.3366911
Jun Chen;Lei Zhang;Weinan Gao
For large scale distributed systems, centralized model predictive control (MPC) often requires high computational resources, while generally distributed MPC can only achieve suboptimal control performance. To address these limitations, this article proposes a new reconfigurable MPC framework for large scale distributed systems, in which an optimal control problem with a time-varying structure is formulated and solved for each control loop. More specifically, at each time step, a subset of the control inputs is dynamically selected to be optimized by MPC, while the previous optimal solution is applied to the remaining control inputs. A theoretical upper bound on the performance loss, due to the fact that only a subset of inputs is optimized, is then derived to guarantee the worst-case performance. To minimize the performance loss, this upper bound is then used to guide the reconfiguration of MPC, i.e., the selection of control inputs for optimization. The applicability of the proposed approach is illustrated through case studies, including battery cell-to-cell balancing control and multivehicle formation control. Numerical results confirm that the proposed approach can achieve better control performance than distributed MPC and requires less computation time than conventional centralized MPC.
{"title":"Reconfigurable Model Predictive Control for Large Scale Distributed Systems","authors":"Jun Chen;Lei Zhang;Weinan Gao","doi":"10.1109/JSYST.2024.3366911","DOIUrl":"10.1109/JSYST.2024.3366911","url":null,"abstract":"For large scale distributed systems, centralized model predictive control (MPC) often requires high computational resources, while generally distributed MPC can only achieve suboptimal control performance. To address these limitations, this article proposes a new reconfigurable MPC framework for large scale distributed systems, in which an optimal control problem with a time-varying structure is formulated and solved for each control loop. More specifically, at each time step, a subset of the control inputs is dynamically selected to be optimized by MPC, while the previous optimal solution is applied to the remaining control inputs. A theoretical upper bound on the performance loss, due to the fact that only a subset of inputs is optimized, is then derived to guarantee the worst-case performance. To minimize the performance loss, this upper bound is then used to guide the reconfiguration of MPC, i.e., the selection of control inputs for optimization. The applicability of the proposed approach is illustrated through case studies, including battery cell-to-cell balancing control and multivehicle formation control. Numerical results confirm that the proposed approach can achieve better control performance than distributed MPC and requires less computation time than conventional centralized MPC.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"965-976"},"PeriodicalIF":4.0,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140034048","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-04DOI: 10.1109/JSYST.2024.3368020
Mengling Li;Ze-Hao Wu;Feiqi Deng;Zhi-Liang Zhao
This article addresses the practical output consensus of a class of heterogeneous leader–follower multiagent systems with directed network topology. The total disturbance of each agent, which is the nonlinear coupling effect of disturbances, uncertainties, and measurement noises mismatched with control inputs in large scale, is estimated in real time by a set of extended state observers. Extended state observers-based consensus protocols are then designed to obtain the output consensus, with the total disturbance of each agent be rejected actively. Both the convergence of the tracking error between outputs of all followers and the output of the leader in practical sense and the boundedness of all states are presented with theoretical analysis. Finally, the rationality of the control strategy and main result are verified by a numerical example.
{"title":"Output Consensus of Heterogeneous Multiagent Systems With Mismatched Uncertainties and Measurement Noises: An ADRC Approach","authors":"Mengling Li;Ze-Hao Wu;Feiqi Deng;Zhi-Liang Zhao","doi":"10.1109/JSYST.2024.3368020","DOIUrl":"10.1109/JSYST.2024.3368020","url":null,"abstract":"This article addresses the practical output consensus of a class of heterogeneous leader–follower multiagent systems with directed network topology. The total disturbance of each agent, which is the nonlinear coupling effect of disturbances, uncertainties, and measurement noises mismatched with control inputs in large scale, is estimated in real time by a set of extended state observers. Extended state observers-based consensus protocols are then designed to obtain the output consensus, with the total disturbance of each agent be rejected actively. Both the convergence of the tracking error between outputs of all followers and the output of the leader in practical sense and the boundedness of all states are presented with theoretical analysis. Finally, the rationality of the control strategy and main result are verified by a numerical example.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1436-1446"},"PeriodicalIF":4.0,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140033961","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
扫码关注我们
求助内容：
应助结果提醒方式：