IEEE Systems Journal最新文献

{"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}

{"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}

{"title":"Multiagent Sensor Integration and Knowledge Distillation System for Real-Time Autonomous Vehicle Navigation","authors":"Mohammad Hijji;Kaleem Ullah;Mohammed Alwakeel;Ahmed Alwakeel;Fahad Aradah;Faouzi Alaya Cheikh;Muhammad Sajjad;Khan Muhammad","doi":"10.1109/JSYST.2024.3524025","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3524025","url":null,"abstract":"This article introduces a comprehensive multiagent prototype system designed to enhance the autonomous navigation capabilities of vehicles by incorporating numerous sensors and components. The system includes features such as an ultrasonic sensor for precise distance measurement, a specially crafted “SonarSpinner” with a wide 160° field of view, a vision sensor for road sign detection and steering angle estimation, and an infrared obstacle avoidance sensor, operating with a predefined obstacle-halting threshold of 150 cm. Data collection for model training and evaluation is accomplished using a virtual reality-based self-driving car simulator, resulting in a diverse dataset. The proposed system harnesses knowledge distillation from teacher models, such as the Nvidia model, to create a lightweight student model optimized for real-time inference while retaining competitive accuracy. Additionally, a custom Haar cascade classifier enhances traffic sign detection capabilities. The distilled model is then converted to TensorFlow Lite for efficient deployment on edge devices within autonomous vehicles, ensuring a secure and efficient navigation system. This innovative approach combines optimized distillation methods with specialized classifiers to facilitate the development of robust and real-time self-driving car systems.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 2","pages":"382-391"},"PeriodicalIF":4.0,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308399","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}

{"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}

{"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}

{"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}

{"title":"Failure Propagation Graphs for Studying Cascading Failure Propagation in Power Networks","authors":"Biwei Li;Dong Liu;Junyuan Fang;Xi Zhang;Chi K. Tse","doi":"10.1109/JSYST.2024.3524246","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3524246","url":null,"abstract":"Cascading failure, characterized by the widespread propagation of failure events, is a common cause for severe blackouts in power networks. Strengthening critical branches in a power network is crucial for mitigating the risk of blackouts resulting from cascading failures. In this article, we propose a time-efficient greedy search method to identify critical branches in a power network. We address the challenge of computational constraints by using a failure propagation graph, which accurately captures the critical failure propagation patterns based on cascading failure simulation. Our approach minimizes cascading failure risk while strategically reinforcing a limited number of branches. The failure-propagation-graph greedy-search (FPG-GS) algorithm selects candidate branches based on cascading failure simulation and iteratively identifies the most crucial branches. Our experimental results on different power systems demonstrate the superior performance and efficiency of the FPG-GS algorithm compared to existing methods. In addition, our study highlights the importance of strategic branch selection, showing that reinforcing one-fifth of the branches can achieve a mitigation rate exceeding 80%.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"258-269"},"PeriodicalIF":4.0,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645240","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}

{"title":"Detection of Detrimental Weak Emergent Behavior Considering Operational Factors: A Case Study in Search and Rescue","authors":"R. A. Haugen;S. Kokkula;A. Ghaderi;G. Muller;E. Syverud","doi":"10.1109/JSYST.2024.3521477","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3521477","url":null,"abstract":"This article applies the design of experiments approach for detecting detrimental weak emergent behavior of an autonomous surface vessel operating in a dynamic environment on a search and rescue mission. The research utilizes orthogonal arrays in combination with regression analysis to systematically test the parameter space of an engineered system function. We explored the parameter space of interest and detected where the system model does not comply with a defined measure of effectiveness. The findings from this case study suggest that these methods enable a systematic exploration of the system's parameter space, allowing for the effective detection of detrimental weak emergent behavior. This approach potentially enhances test coverage, expands system operating knowledge and facilitates mitigation efforts more efficiently.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"43-54"},"PeriodicalIF":4.0,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637896","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}

{"title":"Game-Theoretic Joint Coalition Formation and Power Allocation Strategy for Multitarget Tracking in Distributed Radar Network","authors":"Chenguang Shi;Xuezhang Sun;Xiangrong Dai;Jianjiang Zhou","doi":"10.1109/JSYST.2024.3522100","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3522100","url":null,"abstract":"In this article, a game-theoretic joint coalition formation and power allocation (JCFPA) strategy is investigated for multitarget tracking (MTT) in a distributed radar network. The main objective of the presented strategy is to minimize the total transmit power consumption and enhance the target tracking accuracy concurrently, while adhering to predefined requirements on the MTT performance and system illumination resource budgets, thus improving the low probability of intercept performance. To achieve this, a utility function is developed to evaluate the coalition structure, transmit power consumption, and tracking accuracy. Then, by formulating the cooperative interactions among radars as a coalition game, we establish an optimization model to optimize the coalition structure and power allocation for the distributed radar network. The existence of the Nash equilibrium solution for the game is proven mathematically. To address the optimization model, an iterative three-step algorithm is developed based on the sequential quadratic programming. Numerical results reveal that the presented JCFPA strategy obtains superior system performance compared to other benchmarks.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"234-245"},"PeriodicalIF":4.0,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637948","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}

{"title":"System-Level Analysis of the Directional Radar Coverage for UAV Localization in Dynamic Swarms","authors":"Anna Gaydamaka;Mahmoud T. Kabir;Andrey Samuylov;Dmitri Moltchanov;Bo Tan;Yevgeni Koucheryavy","doi":"10.1109/JSYST.2024.3519887","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3519887","url":null,"abstract":"Numerous mission-critical unmanned aerial vehicle (UAV) operations, such as rescue and surveillance missions, are conducted in areas lacking access to external infrastructure providing precise positioning information. To enhance situational awareness in such scenarios, millimeter wave (mmWave, <inline-formula><tex-math>$text{30}-text{300}$</tex-math></inline-formula> GHz) and subterahertz (sub-THz, <inline-formula><tex-math>$text{100}-text{300}$</tex-math></inline-formula> GHz) range or Doppler radars promising large resolution can be employed. However, the small antenna apertures in these bands naturally call for the use of massive antenna arrays to achieve reasonable detection distances. By employing directional antenna arrays, these radars need to exhaustively scan the surroundings to ensure situational awareness of a UAV in a swarm. The aim of this article is to characterize the system-level performance of mmWave/sub-THz range and Doppler radars as a function of system parameters by accounting for the propagation specifics of the considered bands. To this aim, we combine the tools of stochastic geometry and antenna simulations to determine the optimal half-power beamwidth that minimizes the full scanning time while maximizing the detection probability of all UAVs in a swarm. Our results demonstrate that both types of radars are characterized by qualitatively similar performance. Detection performance is highly sensitive to both UAV density and coverage radius, as the increase in these parameters leads to an abrupt drop in the detection performance. At small distances, <inline-formula><tex-math>$leq!text{50}$</tex-math></inline-formula> m, antenna arrays with a smaller number of elements result in the best tradeoff between scanning time and detection probability. Specifically, both types of radars provide perfect knowledge of the surroundings (with detection probability higher than 0.99) within a 50-m radius with a scanning time of less than 1 ms. At greater distances, <inline-formula><tex-math>$geq! text{100}$</tex-math></inline-formula> m, the only option to improve performance is a drastic increase in the emitted power or receiver sensitivity.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"19 1","pages":"164-175"},"PeriodicalIF":4.0,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10818969","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637897","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}