Xinghua Liu;Jun Yan;Gaoxi Xiao;Xiaoyue Zhang;Tianyang Zhao;Peng Wang
{"title":"Distributed Event-Triggered Fixed-Time Secondary Voltage Control and Automatic Power Sharing for MTDC Grids","authors":"Xinghua Liu;Jun Yan;Gaoxi Xiao;Xiaoyue Zhang;Tianyang Zhao;Peng Wang","doi":"10.1109/JSYST.2024.3469932","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3469932","url":null,"abstract":"In this article, a novel distributed secondary voltage and active power-sharing control strategy with a Zeno-free event triggering mechanism is proposed, to overcome voltage deviation and inaccurate power-sharing caused by the conventional V-P droop control strategy in multiterminal high voltage direct current grids. The secondary controllers can achieve the voltage restoration and proportional active power sharing within a fixed time. Utilizing the Lyapunov method, the trigger function and trigger condition for the controllers of each voltage source converter (VSC) station are designed, resulting in a significant reduction in the number of controller triggers during system transients and steady state. The fixed-time stabilization theory is employed, which allows a faster convergence performance. Moreover, by using the tanh function, we can get rigorous proof of avoiding Zeno behavior. Finally, a simulation model of five connecting VSC stations is built to demonstrate the satisfactory performance of the proposed control strategy.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"2010-2021"},"PeriodicalIF":4.0,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777606","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":"Self-Sustainable Active Reconfigurable Intelligent Surfaces for Antijamming in Wireless Communications","authors":"Yang Cao;Wenchi Cheng;Jingqing Wang;Wei Zhang","doi":"10.1109/JSYST.2024.3470133","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3470133","url":null,"abstract":"Wireless devices can be easily attacked by jammers during transmission, which is a potential security threat for wireless communications. Active reconfigurable intelligent surface (RIS) attracts considerable attention and is expected to be employed in antijamming systems for secure transmission to significantly enhance the antijamming performance. However, active RIS introduces external power load, which increases the complexity of hardware and restricts the flexible deployment of active RIS. To overcome these drawbacks, we design an innovative self-sustainable structure in this article, where the active RIS is energized by harvesting energy from base station signals through the time dividing based simultaneous wireless information and power transfer scheme. Based on the above structure, we develop the BS harvesting scheme based on joint transmit and reflecting beamforming with the aim of maximizing the achievable rate of active RIS-assisted system, where the alternating optimization algorithm based on stochastic successive convex approximation tackles the nonconvex optimization problem in the scheme. Simulation results verified the effectiveness of our developed BS harvesting scheme, which can attain higher antijamming performance than other schemes when given the same maximum transmit power.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"2133-2144"},"PeriodicalIF":4.0,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777901","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":"Characterization of Dynamic Blockages for VLC-Enabled Indoor Industrial Networks","authors":"Anand Singh;Haythem Bany Salameh;Moussa Ayyash;Hany Elagla","doi":"10.1109/JSYST.2024.3470324","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3470324","url":null,"abstract":"Recent advancements in autonomous aerial vehicles (AAVs) and visible light communication (VLC) can revolutionize indoor networks in the era of 6G, offering benefits, such as high accuracy, cost-effectiveness, power efficiency, and improved security. However, VLC-enabled indoor networks face several deployment challenges, including line-of-sight disruptions caused by dynamic obstacles, such as human obstacles and UAVs operating within an indoor area. These dynamic obstacles in the 3-D space can lead to a nonuniform distribution of the received power across the indoor area, adversely impacting the quality of service for indoor users. Therefore, it is crucial to analyze the performance of VLC-enabled indoor networks in the presence of dynamic blockages. This analysis is essential to effectively mitigate the impact of dynamic obstacles and enhance the performance and reliability of indoor networks. This letter provides a performance analysis of VLC-enabled indoor networks for multiple light-emitting-diode configurations in the presence of various blockages, where the blockages (both humans and UAVs) can pause during movement for different pause times. Based on the provided analysis, we develop a model to calculate the blockage probability in indoor networks, and the bit-error-rate performance with varying blockage density is analyzed.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"2173-2176"},"PeriodicalIF":4.0,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777958","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}
Marcos Borges;Lincoln Rocha;Paulo Henrique Mendes Maia;Rodrigo Pereira dos Santos
{"title":"Agape: A Syntactic-Based Analysis Method for Automatic API Connection Points Discovery in Systems-of-Information Systems","authors":"Marcos Borges;Lincoln Rocha;Paulo Henrique Mendes Maia;Rodrigo Pereira dos Santos","doi":"10.1109/JSYST.2024.3465391","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3465391","url":null,"abstract":"Establishing interoperability links is a significant challenge in systems-of-information systems (SoIS) engineering. Even with constituent systems (CS) interfaces documentation, achieving such links is a difficult, time-consuming, and error-prone task that requires attention from CS developers, especially if it is performed manually. In order to contribute to this task, we propose Agape, a semiautomatic method using syntactic similarity analysis of API attributes to identify potential CS connection points. We implemented the AgapeTool tool based on the method and performed two-fold evaluations. In the preliminary evaluation, we executed a controlled experiment to evaluate the performance of AgapeTool and empirically define the best similarity algorithms and thresholds for the task of identifying connection points between two well known API. In the evaluation, we use AgapeTool in two cases involving four CS API from a SoIS of a global computer manufacturer. Then, we conducted semistructured interviews with five experienced developers of the target SoIS to evaluate the outcomes. In practice, the results reveal that AgapeTool is effective in both environments, and API syntactic similarity analysis is efficient for identifying CS interoperability links. From a research point, the combination of syntactic and semantic analyzes looks promising for more accurate and reliable results.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"2052-2061"},"PeriodicalIF":4.0,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777882","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":"Joint Uplink and Downlink Nonorthogonal Resource Allocation for URLLC in Distributed Antenna Systems","authors":"Yifan Zhu;Kang Li;Pengcheng Zhu;Yan Wang","doi":"10.1109/JSYST.2024.3464558","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3464558","url":null,"abstract":"Ultrareliable and low-latency communications (URLLC) is expected to support mission-critical services in industrial Internet of things with its stringent quality-of-service (QoS) metrics. This demands a large consumption of spectrum resource, which is scarce and requires to be configured appropriately. To enhance spectral efficiency and mitigate latency caused by control signaling, we propose a grant-free nonorthogonal multiple access (NOMA) scheme. Packet duplication with frequency diversity (PDFD) is utilized to ensure reliability. The distributed antenna system (DAS) is deployed to further mitigate interdevice interference for URLLC in industrial automation scenarios. With the proposed scheme and antenna configuration, we jointly optimize the uplink and downlink bandwidth assignment and delay components to minimize the total spectrum consumption under the QoS requirements of end-to-end URLLC. A two-step method is then proposed to find the globally optimal solution. In addition, we expand our framework to block segmentation with independent coding mechanism for comparison with PDFD and validate the spectral efficiency superiority of PDFD. Simulation results show the spectral efficiency gain of the two-step method under our proposed schemes, indicating that NOMA integrated with DAS is superior for URLLC with massive devices.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"2121-2132"},"PeriodicalIF":4.0,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777960","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":"Double Event-Triggered Consensus of Positive Multiagent Systems With Disturbance Based on Proportional Integral Observers","authors":"Junfeng Zhang;Tarek Raïssi;Fengyu Lin;Baozhu Du","doi":"10.1109/JSYST.2024.3460747","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3460747","url":null,"abstract":"This article investigates the double event-triggered consensus of positive multiagent systems with disturbance based on proportional integral observers (PIOs). First, PIOs concerning state and disturbance are designed, respectively. Then, a double event-triggered mechanism is presented: One is used to reduce the communication frequency between agents and their observers and the other one is used to reduce the communication frequency between agents and the corresponding control protocols. Moreover, a novel consensus framework is constructed for the systems by introducing a set of new variables, where an additional constant term is added to error dynamics. By constructing a copositive Lyapunov function, the positivity and stability of the systems are reached under the designed proportional integral state and disturbance observers. The gain matrices of the observers and control protocols are formulated via a matrix decomposition technique and computed in terms of linear programming. Finally, one example is presented to verify the effectiveness of the consensus algorithm.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"2030-2041"},"PeriodicalIF":4.0,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777612","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":"Average Sparse Attention for Dense Video Captioning From Multiperspective Edge-Computing Cameras","authors":"Ling-Hsuan Huang;Ching-Hu Lu","doi":"10.1109/JSYST.2024.3456864","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3456864","url":null,"abstract":"In recent years, the artificial intelligence of things (AIoT) has accelerated the development of edge computing. Since existing edge computing for dense video captioning has only explored single-camera decision-making, we propose a lightweight image stitching model that uses a proposed inverted pruned residual model to realize multicamera decision-making to generate more accurate captions. Existing dense video captioning uses an intensive attention mechanism, which readily results in the loss of important information. Thus, our study proposes an average sparse attention mechanism such that the resultant dense video-captioning model is better able to focus on important information and improve the quality of its generated captions. The experiments show that the lightweight video stitching model can reduce model parameters by 13.40% and increase frames per second by 28.96% on an edge platform when compared to the latest studies. Furthermore, a dense video caption network with the average sparse attention mechanism yielded improvements of 22.97% for BLEU3, 35.04% for BLEU4, and 7.51% for METEOR.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"1939-1950"},"PeriodicalIF":4.0,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777959","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}
Tan N. Nguyen;Trinh Van Chien;Dinh-Hieu Tran;Bui Vu Minh;Nguyen Chi Ngon;Miroslav Voznak;Zhiguo Ding
{"title":"Cooperative Satellite-Terrestrial Networks With Imperfect CSI and Multiple Jammers: Performance Analysis and Deep Learning Evaluation","authors":"Tan N. Nguyen;Trinh Van Chien;Dinh-Hieu Tran;Bui Vu Minh;Nguyen Chi Ngon;Miroslav Voznak;Zhiguo Ding","doi":"10.1109/JSYST.2024.3463715","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3463715","url":null,"abstract":"This article introduces novel and deep learning approaches for the security analysis of a hybrid satellite-terrestrial cooperative network. More specifically, a satellite transmits information to a ground user through multiple relays in the presence of an eavesdropper. To prevent potential eavesdropping, multiple friendly jammers are employed to disrupt the reception process of the eavesdropper by artificial noise. Within this setting, we then derive the closed-form expressions of the outage probability (OP) and secrecy outage probability (SOP) of the considered system in the presence of imperfect channel state information. Important to mention is the fact that in complex systems (e.g., with multiple jammers, multiple relays, and considering the independent but nonidentically distributed Rician nature of satellite links), analytical approaches may not be effective due to their complex mathematical derivations. As such, we develop a highly effective yet low-complexity deep learning approach to estimate the OP and SOP of the system. Through extensive Monte Carlo simulations, we evaluate the OP and SOP of the system in various settings and demonstrate the effectiveness of the proposed solutions. Interestingly, the proposed deep learning method can achieve comparable performance to that of the analytical approach.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"2062-2073"},"PeriodicalIF":4.0,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777900","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}
Xiaobo Wang;Qiong Wu;Pingyi Fan;Qiang Fan;Huiling Zhu;Jiangzhou Wang
{"title":"Vehicle Selection for C-V2X Mode 4-Based Federated Edge Learning Systems","authors":"Xiaobo Wang;Qiong Wu;Pingyi Fan;Qiang Fan;Huiling Zhu;Jiangzhou Wang","doi":"10.1109/JSYST.2024.3459926","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3459926","url":null,"abstract":"As the rise of information and communication technology, the cooperative work of vehicles has become crucial in realizing Internet of Vehicles (IoV). Federated learning (FL) is a promising technology to protect vehicles' privacy in IoV. Vehicles with limited computation capacity may face a large computational burden associated with FL. Federated edge learning (FEEL) systems are introduced to solve such a problem. In FEEL systems, vehicles adopt the cellular-vehicle to everything (C-V2X) mode 4 to upload encrypted data to road side units' (RSUs) cache queue. Then, RSUs train the data transmitted by vehicles, update the local model hyperparameters, and send back results to vehicles, thus, vehicles' computational burden can be released. However, each RSU has limited cache queue. To maintain the stability of cache queue and maximize the accuracy of model, it is essential to select appropriate vehicles to upload data. The vehicle selection method for FEEL systems faces challenges due to the random departure of data from the cache queue caused by the stochastic channel and the different system status of vehicles. This article proposes a vehicle selection method for FEEL systems that aims to maximize the accuracy of model while keeping the cache queue stable. Extensive simulation experiments demonstrate that our proposed method outperforms other baseline selection methods.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 4","pages":"1927-1938"},"PeriodicalIF":4.0,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777898","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":"IEEE Systems Council Information","authors":"","doi":"10.1109/JSYST.2024.3428029","DOIUrl":"https://doi.org/10.1109/JSYST.2024.3428029","url":null,"abstract":"","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 3","pages":"C3-C3"},"PeriodicalIF":4.0,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10678817","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169598","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}