The introduction of building information management (BIM) to enable the management and delivery of megaprojects has illuminated the importance of system integration (SI) to coordinate and bring together complex interdependent technical and organizational systems. SI can inform and address the emerging interdependencies with BIM processes and technologies in megaprojects. Thus, in this article, we extend the theorizing of SI and BIM for the management of megaprojects in the infrastructure sector. This process involves 1) conceptualizing the complementarity and compatibility of SI and BIM in the management of megaprojects, and 2) offering an integrative framework and model of SI and BIM. Finally, we discuss and highlight this twofold contribution and offer insights into future research.
引入建筑信息管理（BIM）以实现超大型项目的管理和交付，揭示了系统集成（SI）在协调和汇集复杂的相互依存的技术和组织系统方面的重要性。系统集成可以为超大型项目中的 BIM 流程和技术提供信息，并解决新出现的相互依存问题。因此，在本文中，我们将扩展 SI 和 BIM 的理论，用于基础设施领域的超大型项目管理。这一过程包括：1）将 SI 和 BIM 在巨型项目管理中的互补性和兼容性概念化；2）提供 SI 和 BIM 的整合框架和模型。最后，我们讨论并强调了这两方面的贡献，并对未来研究提出了见解。
{"title":"Complementarity and Compatibility of Systems Integration and Building Information Management","authors":"Mikela Chatzimichailidou;Tim Whitcher;Nikola Suzic","doi":"10.1109/JSYST.2024.3387064","DOIUrl":"10.1109/JSYST.2024.3387064","url":null,"abstract":"The introduction of building information management (BIM) to enable the management and delivery of megaprojects has illuminated the importance of system integration (SI) to coordinate and bring together complex interdependent technical and organizational systems. SI can inform and address the emerging interdependencies with BIM processes and technologies in megaprojects. Thus, in this article, we extend the theorizing of SI and BIM for the management of megaprojects in the infrastructure sector. This process involves 1) conceptualizing the complementarity and compatibility of SI and BIM in the management of megaprojects, and 2) offering an integrative framework and model of SI and BIM. Finally, we discuss and highlight this twofold contribution and offer insights into future research.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1198-1207"},"PeriodicalIF":4.0,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140806732","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-17DOI: 10.1109/JSYST.2024.3384372
Daotong Zhang;Peng Shi;Ramesh K. Agarwal;Levente Kovács
This article presents a novel model predictive control (MPC) framework with an integrated disturbance observer for cyber-physical systems (CPSs) under denial-of-service (DoS) attacks. Uniquely incorporating a memory module, our MPC approach is tailored to maintain stability and security in CPS during DoS attacks, which typically disrupt communication and degrade performance. Our method stands out by addressing time-varying system uncertainties through the disturbance observer, enhancing robustness under these attack conditions. The effectiveness of our approach is validated through numerical simulations, hardware-in-the-loop experiments, and comparative analyses using an omnidirectional robot, highlighting its practical applicability and advancement over existing methods.
本文介绍了一种新颖的模型预测控制（MPC）框架，该框架集成了干扰观测器，可用于拒绝服务（DoS）攻击下的网络物理系统（CPS）。我们的 MPC 方法独特地集成了内存模块，专门用于在 DoS 攻击期间保持 CPS 的稳定性和安全性，DoS 攻击通常会破坏通信并降低性能。我们的方法通过干扰观测器解决了时变系统不确定性问题，增强了在这些攻击条件下的鲁棒性。我们通过数值模拟、硬件在环实验以及使用全向机器人进行比较分析，验证了我们方法的有效性，突出了其实际适用性以及与现有方法相比的先进性。
{"title":"Reference Tracking MPC for Cyber-Physical Systems Under Denial-of-Service Attacks: An Omnidirectional Robot Application","authors":"Daotong Zhang;Peng Shi;Ramesh K. Agarwal;Levente Kovács","doi":"10.1109/JSYST.2024.3384372","DOIUrl":"10.1109/JSYST.2024.3384372","url":null,"abstract":"This article presents a novel model predictive control (MPC) framework with an integrated disturbance observer for cyber-physical systems (CPSs) under denial-of-service (DoS) attacks. Uniquely incorporating a memory module, our MPC approach is tailored to maintain stability and security in CPS during DoS attacks, which typically disrupt communication and degrade performance. Our method stands out by addressing time-varying system uncertainties through the disturbance observer, enhancing robustness under these attack conditions. The effectiveness of our approach is validated through numerical simulations, hardware-in-the-loop experiments, and comparative analyses using an omnidirectional robot, highlighting its practical applicability and advancement over existing methods.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1248-1256"},"PeriodicalIF":4.0,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140804840","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-16DOI: 10.1109/JSYST.2024.3381304
Hao Zhang;Jie Yao;Zhuping Wang;Sheng Gao;Huaicheng Yan
This article studies the optimal distributed denial-of-service attack strategy for cyber–physical systems with multiple attackers and multiple defenders. An advanced attack strategy is proposed to cause the great damage to system in a multiattacker–defender form. First, a novel model of signal-to-interference-to-noise ratio for the multiattacker and multidefender is built. Taking the energy constraints into consideration, the objective of defenders is to minimize the system performance, while the attackers tend to deteriorate it by emitting interference energy. Thus, the optimal channel selection and optimal energy allocation strategies are proposed to answer which channel both of them should choose and how much power both of them should allocate to each channel in a finite time horizon. Second, a two-player zero-sum matrix game is formulated to solve the optimal problem by linear programming and obtain the Nash equilibrium. When the channel parameters are time-varying, a dynamic optimal channel selection problem is considered and a multistage game algorithm is proposed to find the Nash equilibrium. In addition, the designed optimal strategies of both players are demonstrated and analyzed. Finally, a numerical simulation is provided to illustrate the effectiveness of the proposed approach.
{"title":"Optimal DDoS Attack Strategy for Cyber–Physical Systems: A Multiattacker–Defender Game","authors":"Hao Zhang;Jie Yao;Zhuping Wang;Sheng Gao;Huaicheng Yan","doi":"10.1109/JSYST.2024.3381304","DOIUrl":"10.1109/JSYST.2024.3381304","url":null,"abstract":"This article studies the optimal distributed denial-of-service attack strategy for cyber–physical systems with multiple attackers and multiple defenders. An advanced attack strategy is proposed to cause the great damage to system in a multiattacker–defender form. First, a novel model of signal-to-interference-to-noise ratio for the multiattacker and multidefender is built. Taking the energy constraints into consideration, the objective of defenders is to minimize the system performance, while the attackers tend to deteriorate it by emitting interference energy. Thus, the optimal channel selection and optimal energy allocation strategies are proposed to answer which channel both of them should choose and how much power both of them should allocate to each channel in a finite time horizon. Second, a two-player zero-sum matrix game is formulated to solve the optimal problem by linear programming and obtain the Nash equilibrium. When the channel parameters are time-varying, a dynamic optimal channel selection problem is considered and a multistage game algorithm is proposed to find the Nash equilibrium. In addition, the designed optimal strategies of both players are demonstrated and analyzed. Finally, a numerical simulation is provided to illustrate the effectiveness of the proposed approach.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"929-940"},"PeriodicalIF":4.0,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140615033","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-15DOI: 10.1109/JSYST.2024.3378699
Long Ma;Yuan Zhang
Internet of Things (IoT) devices frequently encounter various challenges, including limited power, spectrum, and memory resources, as well as harsh environments conditions. Therefore, the development of an efficient transmission scheme is crucial for ensuring reliable and secure communication in IoT networks. In this article, an adaptive semi-grant-free (SGF) transmission scheme is proposed for reliable uplink nonorthogonal multiple access systems with enhanced security, in which a ratio-based user scheduling criterion and a hybrid successive interference cancellation technique are employed to suppress the activity of untrusted nodes while ensuring reliable transmission. To evaluate the superiority of the adaptive scheme, a conventional static transmission scheme and a worst-case eavesdropping scenario are used as benchmarks. Simulation results show that the adaptive scheme outperforms the conventional schemes in terms of outage and intercept probability. In addition, the closed-form results of grant-based user's and grant-free user's outage probability and untrusted node's intercept probability are derived. Compared to existing literature, this work provides a comprehensive view of security-reliability tradeoff analysis of SGF transmissions.
{"title":"Security-Reliability Analysis for Adaptive Semi-Grant-Free Transmissions","authors":"Long Ma;Yuan Zhang","doi":"10.1109/JSYST.2024.3378699","DOIUrl":"10.1109/JSYST.2024.3378699","url":null,"abstract":"Internet of Things (IoT) devices frequently encounter various challenges, including limited power, spectrum, and memory resources, as well as harsh environments conditions. Therefore, the development of an efficient transmission scheme is crucial for ensuring reliable and secure communication in IoT networks. In this article, an adaptive semi-grant-free (SGF) transmission scheme is proposed for reliable uplink nonorthogonal multiple access systems with enhanced security, in which a ratio-based user scheduling criterion and a hybrid successive interference cancellation technique are employed to suppress the activity of untrusted nodes while ensuring reliable transmission. To evaluate the superiority of the adaptive scheme, a conventional static transmission scheme and a worst-case eavesdropping scenario are used as benchmarks. Simulation results show that the adaptive scheme outperforms the conventional schemes in terms of outage and intercept probability. In addition, the closed-form results of grant-based user's and grant-free user's outage probability and untrusted node's intercept probability are derived. Compared to existing literature, this work provides a comprehensive view of security-reliability tradeoff analysis of SGF transmissions.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1080-1091"},"PeriodicalIF":4.0,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582673","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 investigates completely distributed secure consensus control (SCC) of high-order linear and Lipschitz nonlinear multiagent systems (MASs) in the presence of interaction link attacks, respectively, where the design criteria are independent of the interaction topology and the parameters of interaction link attacks. An estimator-based adaptive SCC protocol is proposed to realize SCC, where coupling weights of the virtual distributed reference state estimator (VDRSE) are adaptively adjusted to eliminate the impacts of interaction link attacks. Then, the leader–follower and leaderless structures are unified into a general directed graph framework by decomposing the Laplacian matrix in terms of the root node and nonroot node, and sufficient conditions for VDRSEs achieving reference state consensus and high-order linear MASs achieving SCC are given, respectively. Moreover, main results of high-order linear MASs are extended to Lipschitz nonlinear MASs. Finally, two numerical examples are presented in order to validate the theoretical results.
本文分别研究了存在交互链路攻击的高阶线性多代理系统（MAS）和利普希茨非线性多代理系统（MAS）的完全分布式安全共识控制（SCC），其中设计标准与交互拓扑和交互链路攻击参数无关。为实现 SCC，提出了一种基于估计器的自适应 SCC 协议，即自适应调整虚拟分布式参考状态估计器（VDRSE）的耦合权重，以消除交互链路攻击的影响。然后，通过分解根节点和非根节点的拉普拉卡矩阵，将领导者-跟随者结构和无领导者结构统一到一般有向图框架中，并分别给出了 VDRSE 实现参考状态共识和高阶线性 MAS 实现 SCC 的充分条件。此外，还将高阶线性 MAS 的主要结果扩展到 Lipschitz 非线性 MAS。最后，介绍了两个数值示例，以验证理论结果。
{"title":"Completely Distributed Secure Consensus for Multiagent Systems With a General Directed Graph Under Interaction Link Attacks","authors":"Miao Zhao;Jianxiang Xi;Le Wang;Kehan Xia;Yuanshi Zheng","doi":"10.1109/JSYST.2024.3381914","DOIUrl":"10.1109/JSYST.2024.3381914","url":null,"abstract":"This article investigates completely distributed secure consensus control (SCC) of high-order linear and Lipschitz nonlinear multiagent systems (MASs) in the presence of interaction link attacks, respectively, where the design criteria are independent of the interaction topology and the parameters of interaction link attacks. An estimator-based adaptive SCC protocol is proposed to realize SCC, where coupling weights of the virtual distributed reference state estimator (VDRSE) are adaptively adjusted to eliminate the impacts of interaction link attacks. Then, the leader–follower and leaderless structures are unified into a general directed graph framework by decomposing the Laplacian matrix in terms of the root node and nonroot node, and sufficient conditions for VDRSEs achieving reference state consensus and high-order linear MASs achieving SCC are given, respectively. Moreover, main results of high-order linear MASs are extended to Lipschitz nonlinear MASs. Finally, two numerical examples are presented in order to validate the theoretical results.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1380-1391"},"PeriodicalIF":4.0,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582896","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}
Low Earth orbit (LEO) satellites have recently received considerable attention because they can provide stronger signal power and better bandwidth availability than medium Earth orbit or geosynchronous orbit satellites. However, due to the limited processing capability of a receiver, it is difficult to utilize all the measurements of the available satellites in view when the number of satellites is large. With this motivation, selecting a subset of satellites that are in a good geometry relative to the receiver for precise positioning among a large number of available LEO constellations represents a challenging yet significant problem. Geometric dilution of precision (GDOP) is a metric that provides useful information about the relative geometry between satellites and a receiver. In this study, we put forth a novel GDOP-based satellite selection algorithm that uses efficient matrix decomposition and update rule. Simulation results show that the proposed algorithm achieves a GDOP performance close to the optimal exhaustive search-based schemes while greatly reducing the computational complexity. In particular, the computational complexity is verified in terms of flop counts as well as numerical evaluations.
{"title":"GDOP-Based Low-Complexity LEO Satellite Subset Selection for Positioning","authors":"Kyeongjun Ko;M. Humayun Kabir;Jungtai Kim;Wonjae Shin","doi":"10.1109/JSYST.2024.3383092","DOIUrl":"10.1109/JSYST.2024.3383092","url":null,"abstract":"Low Earth orbit (LEO) satellites have recently received considerable attention because they can provide stronger signal power and better bandwidth availability than medium Earth orbit or geosynchronous orbit satellites. However, due to the limited processing capability of a receiver, it is difficult to utilize all the measurements of the available satellites in view when the number of satellites is large. With this motivation, selecting a subset of satellites that are in a good geometry relative to the receiver for precise positioning among a large number of available LEO constellations represents a challenging yet significant problem. Geometric dilution of precision (GDOP) is a metric that provides useful information about the relative geometry between satellites and a receiver. In this study, we put forth a novel GDOP-based satellite selection algorithm that uses efficient matrix decomposition and update rule. Simulation results show that the proposed algorithm achieves a GDOP performance close to the optimal exhaustive search-based schemes while greatly reducing the computational complexity. In particular, the computational complexity is verified in terms of flop counts as well as numerical evaluations.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"989-996"},"PeriodicalIF":4.0,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582892","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-10DOI: 10.1109/JSYST.2024.3379856
Shah Fahad;Arman Goudarzi;Rui Bo;Muhammad Waseem;Rashid Al-Ammari;Atif Iqbal
Over the past decade, PQ regulation schemes for a single-controllable active distribution network (ADN) using coordination among a network of virtual synchronous generators (VSGs) have been proposed. However, considering the variable nature of intermittent renewable energy sources (IRESs), coupling a cluster of IRESs with the point of common coupling (PCC) of ADN could inflict transient issues for the power management of the whole ADN. To counter these challenges, the proposed study has three main objectives: 1) To propose a modified mathematical model that represents the apparent resistance-reactance at the PCC of ADN in relation to the PQ coordination among the network of VSGs; 2) to utilize the proposed model for deriving a $mu$ synthesis-based robust controller that overcomes the uncertainty in the moment of inertia response of all the VSGs; 3) and to present the stability and performance analysis of the proposed controller validated under model uncertainty. Validation of the proposed method and its comparison to the state-of-the-art methods in MATLAB/Simulink environment confirms that the proposed method significantly minimizes the impact of disturbances on the power management of the whole ADN.
{"title":"A Robust Demand Regulation Strategy for DERs in a Single-Controllable Active Distribution Network","authors":"Shah Fahad;Arman Goudarzi;Rui Bo;Muhammad Waseem;Rashid Al-Ammari;Atif Iqbal","doi":"10.1109/JSYST.2024.3379856","DOIUrl":"10.1109/JSYST.2024.3379856","url":null,"abstract":"Over the past decade, PQ regulation schemes for a single-controllable active distribution network (ADN) using coordination among a network of virtual synchronous generators (VSGs) have been proposed. However, considering the variable nature of intermittent renewable energy sources (IRESs), coupling a cluster of IRESs with the point of common coupling (PCC) of ADN could inflict transient issues for the power management of the whole ADN. To counter these challenges, the proposed study has three main objectives: 1) To propose a modified mathematical model that represents the apparent resistance-reactance at the PCC of ADN in relation to the PQ coordination among the network of VSGs; 2) to utilize the proposed model for deriving a \u0000<inline-formula><tex-math>$mu$</tex-math></inline-formula>\u0000 synthesis-based robust controller that overcomes the uncertainty in the moment of inertia response of all the VSGs; 3) and to present the stability and performance analysis of the proposed controller validated under model uncertainty. Validation of the proposed method and its comparison to the state-of-the-art methods in MATLAB/Simulink environment confirms that the proposed method significantly minimizes the impact of disturbances on the power management of the whole ADN.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1162-1173"},"PeriodicalIF":4.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582983","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-09DOI: 10.1109/JSYST.2024.3381590
Shouxi Luo;Ke Li;Huanlai Xing;Pingzhi Fan
Nowadays, serverless computing has been widely employed and viewed as the new paradigm of cloud computing. Technically, serverless applications are made up of function components, which are packaged as specific layered files named container images. In production, different components are designed to partially share layers, and during the deployment, the hosting servers have to download the missing layers first, which might dominate the application startup delay. In this article, we look into optimizing the deployment of serverless applications under the operational goals of energy saving and load balance , by exploring the reusability among involved container images to conduct content-aware component placements explicitly. We find that the two involved optimization problems can be formulated as multi-objective (mixed-)integer linear programs , and prove that their common building block of minimizing the weighted sum of deployment cost for a given set of serverless components is non-deterministic polynomial (NP)-hard. To be practical, we develop an efficient yet flexible heuristic solution named best fit greedy placement (BFGP), which involves three variants BFGP-Full, BFGP-ES, and BFGP-LB for the problem. Performance studies show that BFGP is effective, expressive, and efficient. It not only achieves near-optimal placement very efficiently but also supports high-level operational policies, such as energy saving and load balance .
{"title":"Efficient and Flexible Component Placement for Serverless Computing","authors":"Shouxi Luo;Ke Li;Huanlai Xing;Pingzhi Fan","doi":"10.1109/JSYST.2024.3381590","DOIUrl":"10.1109/JSYST.2024.3381590","url":null,"abstract":"Nowadays, serverless computing has been widely employed and viewed as the new paradigm of cloud computing. Technically, serverless applications are made up of function components, which are packaged as specific layered files named container images. In production, different components are designed to partially share layers, and during the deployment, the hosting servers have to download the missing layers first, which might dominate the application startup delay. In this article, we look into optimizing the deployment of serverless applications under the operational goals of \u0000<italic>energy saving</i>\u0000 and \u0000<italic>load balance</i>\u0000, by exploring the reusability among involved container images to conduct content-aware component placements explicitly. We find that the two involved optimization problems can be formulated as \u0000<italic>multi-objective (mixed-)integer linear programs</i>\u0000, and prove that their common building block of minimizing the weighted sum of deployment cost for a given set of serverless components is non-deterministic polynomial (NP)-hard. To be practical, we develop an efficient yet flexible heuristic solution named best fit greedy placement (BFGP), which involves three variants BFGP-Full, BFGP-ES, and BFGP-LB for the problem. Performance studies show that BFGP is effective, expressive, and efficient. It not only achieves near-optimal placement very efficiently but also supports high-level operational policies, such as \u0000<italic>energy saving</i>\u0000 and \u0000<italic>load balance</i>\u0000.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1104-1114"},"PeriodicalIF":4.0,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582669","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-08DOI: 10.1109/JSYST.2024.3379456
Abuzar B. M. Adam;Mohamed Amine Ouamri;Xiaoyu Wan;Mohammed Saleh Ali Muthanna;Reem Alkanhel;Ammar Muthanna;Xingwang Li
In this article, we study the secure communication in unmanned aerial vehicle (UAV) aided and reconfigurable intelligent surface (RIS) empowered multiuser networks. In the proposed configuration, we consider UAV-mounted RIS to reflect the signal between the base station and the legitimate users in the presence of eavesdroppers. The problem is formulated as secrecy rate maximization with channel uncertainty constraints, which is nonconvex. Therefore, we decouple it into beamforming, phase shift, and UAV trajectory subproblems which are jointly optimized. For the beamforming and phase shift subproblems, we apply S-procedure and general sign-definiteness to transform them into tractable forms. And for the UAV trajectory, we unroll the constraints and apply first-order Taylor transform and the difference of two convex functions (DC) to obtain a relaxed convex problem that can be numerically solved. The proposed solution show effectiveness and improved the secrecy rate of the network.
本文研究了无人机（UAV）辅助和可重构智能表面（RIS）赋能的多用户网络中的安全通信。在建议的配置中，我们考虑了无人机安装的 RIS，以在存在窃听者的情况下反映基站与合法用户之间的信号。该问题被表述为带有信道不确定性约束的保密率最大化，这是个非凸问题。因此，我们将其分解为波束成形、相移和无人机轨迹子问题，并对其进行联合优化。对于波束成形和相移子问题，我们采用 S 过程和一般符号定义将其转化为可处理的形式。而对于无人机轨迹，我们解开了约束条件，并应用一阶泰勒变换和两个凸函数之差（DC）得到了一个可以数值求解的松弛凸问题。所提出的解决方案显示出了有效性，并提高了网络的保密率。
{"title":"Secure Communication in UAV–RIS-Empowered Multiuser Networks: Joint Beamforming, Phase Shift, and UAV Trajectory Optimization","authors":"Abuzar B. M. Adam;Mohamed Amine Ouamri;Xiaoyu Wan;Mohammed Saleh Ali Muthanna;Reem Alkanhel;Ammar Muthanna;Xingwang Li","doi":"10.1109/JSYST.2024.3379456","DOIUrl":"10.1109/JSYST.2024.3379456","url":null,"abstract":"In this article, we study the secure communication in unmanned aerial vehicle (UAV) aided and reconfigurable intelligent surface (RIS) empowered multiuser networks. In the proposed configuration, we consider UAV-mounted RIS to reflect the signal between the base station and the legitimate users in the presence of eavesdroppers. The problem is formulated as secrecy rate maximization with channel uncertainty constraints, which is nonconvex. Therefore, we decouple it into beamforming, phase shift, and UAV trajectory subproblems which are jointly optimized. For the beamforming and phase shift subproblems, we apply S-procedure and general sign-definiteness to transform them into tractable forms. And for the UAV trajectory, we unroll the constraints and apply first-order Taylor transform and the difference of two convex functions (DC) to obtain a relaxed convex problem that can be numerically solved. The proposed solution show effectiveness and improved the secrecy rate of the network.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1009-1019"},"PeriodicalIF":4.0,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140582990","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.3379281
Jie Wang;Jiamin Li;Pengcheng Zhu;Dongming Wang;Bin Sheng;Xiaohu You
As dominating 6G-standard service, massive ultrareliable low-latency communications (mURLLC) strive to meet the strict requirements of massive users on latency and error rate. Compared with the traditional grant-based random access (GBRA), the grant-free random access (GFRA) allows users to directly transmit data, which avoid heavy signaling overhead and reduce delay. However, pilot collision interference resulting from uncoordinated resource selection in GFRA leads to serious transmission failure, especially in mURLLC scenarios. Therefore, this article proposes an adaptive feedback-aided hybrid random access mechanism based on the advantages of GBRA and GFRA in cell-free networks. In the proposed mechanism, the feedback factors inserted between pilot and data not only make different access policies for massive users in real time, but also achieve an acceptable tradeoff among signaling overhead, access success probability and access delay. The spatial sparsity of cell-free networks is further utilized to solve the pilot collision and improve the successful access probability. The simulation results demonstrate that the proposed hybrid random access mechanism can improve access throughout with lower signaling overhead and better meet the requirements of mURLLC.
{"title":"Adaptive Feedback-Aided Hybrid Random Access for mURLLC Service Over Cell-Free Networks","authors":"Jie Wang;Jiamin Li;Pengcheng Zhu;Dongming Wang;Bin Sheng;Xiaohu You","doi":"10.1109/JSYST.2024.3379281","DOIUrl":"10.1109/JSYST.2024.3379281","url":null,"abstract":"As dominating 6G-standard service, massive ultrareliable low-latency communications (mURLLC) strive to meet the strict requirements of massive users on latency and error rate. Compared with the traditional grant-based random access (GBRA), the grant-free random access (GFRA) allows users to directly transmit data, which avoid heavy signaling overhead and reduce delay. However, pilot collision interference resulting from uncoordinated resource selection in GFRA leads to serious transmission failure, especially in mURLLC scenarios. Therefore, this article proposes an adaptive feedback-aided hybrid random access mechanism based on the advantages of GBRA and GFRA in cell-free networks. In the proposed mechanism, the feedback factors inserted between pilot and data not only make different access policies for massive users in real time, but also achieve an acceptable tradeoff among signaling overhead, access success probability and access delay. The spatial sparsity of cell-free networks is further utilized to solve the pilot collision and improve the successful access probability. The simulation results demonstrate that the proposed hybrid random access mechanism can improve access throughout with lower signaling overhead and better meet the requirements of mURLLC.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1269-1276"},"PeriodicalIF":4.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140585291","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
扫码关注我们
求助内容：
应助结果提醒方式：