IEEE Transactions on Green Communications and Networking最新文献_第10页

NetDP: In-Network Differential Privacy for Large-Scale Data Processing NetDP：用于大规模数据处理的网络内差异保密技术

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-23 DOI: 10.1109/TGCN.2024.3432781

Zhengyan Zhou;Hanze Chen;Lingfei Chen;Dong Zhang;Chunming Wu;Xuan Liu;Muhammad Khurram Khan

{"title":"NetDP: In-Network Differential Privacy for Large-Scale Data Processing","authors":"Zhengyan Zhou;Hanze Chen;Lingfei Chen;Dong Zhang;Chunming Wu;Xuan Liu;Muhammad Khurram Khan","doi":"10.1109/TGCN.2024.3432781","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3432781","url":null,"abstract":"Radio access network (RAN) enables large-scale collection of sensitive data. Privacy-preserving techniques aim to learn knowledge from sensitive data to improve services without compromising privacy. However, as the data scale increases, enforcing privacy-preserving techniques on sensitive data may consume a considerable amount of system resources and impose performance penalties. To reduce system resource consumption, we present NetDP, an in-network architecture for privacy-preserving techniques by leveraging programmable switches to improve resource efficiency (i.e., CPU cycles, network bandwidth, and privacy budgets). The key idea of NetDP is to accommodate and exploit cryptographic operators to reduce resource consumption rather than repetitively and exhaustively suppressing the impact of these techniques. To the best of our knowledge, this is the first time that privacy-preserving techniques in a large-scale data processing system have been enforced on programmable switches. Our experiments based on Tofino switches indicate that NetDP significantly reduces computation latency (e.g., 40.2%-55.8% latency in computations) without impacting fidelity.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 3","pages":"1076-1089"},"PeriodicalIF":5.3,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Renewable Energy Powered and Open RAN-Based Architecture for 5G Fixed Wireless Access Provisioning in Rural Areas 以可再生能源为动力、基于开放式 RAN 的架构为农村地区提供 5G 固定无线接入服务

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-22 DOI: 10.1109/TGCN.2024.3431989

Anselme Ndikumana;Kim Khoa Nguyen;Mohamed Cheriet

{"title":"Renewable Energy Powered and Open RAN-Based Architecture for 5G Fixed Wireless Access Provisioning in Rural Areas","authors":"Anselme Ndikumana;Kim Khoa Nguyen;Mohamed Cheriet","doi":"10.1109/TGCN.2024.3431989","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3431989","url":null,"abstract":"Due to the high costs of optical fiber deployment in Low-Density and Rural Areas (LDRAs), 5G Fixed Wireless Access (5G FWA) recently emerged as an affordable solution. A widely adopted deployment scenario of 5G FWA includes edge cloud that supports computing services and Radio Access Network (RAN) functions. Such edge cloud requires network and energy resources for 5G FWA. This paper proposes renewable energy powered and Open RAN-based architecture for 5G FWA serving LDRAs using three-level closed-loops. Open RAN is a new 5G RAN architecture allowing Open Central Unit and Open Distributed Unit to be distributed in virtualized environment. The first closed-loop distributes radio resources to Open RAN instances and slices at the edge cloud. The second closed-loop allocates radio resources to houses. We design a new energy model that leverages renewable energy. We jointly optimize radio and energy resource allocation in closed-loop 3. We formulate ultra-small and small-time scale optimization problems that link closed-loops to maximize communication utility while minimizing energy costs. We propose reinforcement learning and successive convex approximation to solve the formulated problems. Then, we use solution data and continual learning to improve resource allocation on a large time scale. Our proposal satisfies 97.14% slice delay budget.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 3","pages":"994-1007"},"PeriodicalIF":5.3,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

STAR-RIS-Aided Covert Communications in MISO-RSMA Systems MISO-RSMA 系统中的 STAR-RIS 辅助隐蔽通信

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-22 DOI: 10.1109/TGCN.2024.3432656

Heng Chang;Xueyu Kang;Hongjiang Lei;Theodoros A. Tsiftsis;Gaofeng Pan;Hongwu Liu

{"title":"STAR-RIS-Aided Covert Communications in MISO-RSMA Systems","authors":"Heng Chang;Xueyu Kang;Hongjiang Lei;Theodoros A. Tsiftsis;Gaofeng Pan;Hongwu Liu","doi":"10.1109/TGCN.2024.3432656","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3432656","url":null,"abstract":"In this paper, a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) is deployed to aid covert communications in a multiple-input single-output (MISO) rate-splitting multiple access (RSMA) system. To maximize the covert communication rate, which is characterized by the shared common rate and private rate of the covert user, the transmit beamforming, reflection/refraction beamforming, and common rate allocation need to be jointly optimized. By decoupling the original covert communication rate maximization problem into three sub-problems, an alternating optimization (AO) algorithm is designed to obtain the optimized solution to achieve the maximum covert communication rate. For the sub-problem of optimizing the common rate allocation, a closed-form expression is derived for the optimal common rate allocation. For the multiple-ratio fractional programming sub-problems of optimizing the transmit beamforming and reflection/refraction beamforming, Lagrangian dual formulation and quadratic transformation are utilized to reconstruct the objective function in the form difference of convex functions. Then, a penalized successive convex approximation is utilized to tackle the rank-one constrained beamforming optimization. Simulation results clarify the effectiveness of the proposed AO algorithm to achieve the maximum covert communication rate. Compared to the benchmark scheme in which the common rate allocation is missing, it is verified by simulation results that the STAR-RIS-aided MISO-RSMA scheme effectively increases the covert communication rate.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1318-1331"},"PeriodicalIF":5.3,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Task Dependency Aware Optimal Resource Allocation for URLLC Edge Network: A Digital Twin Approach Using Finite Blocklength 基于任务依赖的URLLC边缘网络资源优化分配：基于有限块长度的数字孪生方法

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-12 DOI: 10.1109/TGCN.2024.3425442

Muhammad Awais;Haris Pervaiz;Qiang Ni;Wenjuan Yu

{"title":"Task Dependency Aware Optimal Resource Allocation for URLLC Edge Network: A Digital Twin Approach Using Finite Blocklength","authors":"Muhammad Awais;Haris Pervaiz;Qiang Ni;Wenjuan Yu","doi":"10.1109/TGCN.2024.3425442","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3425442","url":null,"abstract":"Next-generation wireless networks envision ubiquitous access and computational capabilities by seamlessly integrating aerial and terrestrial networks. Digital twin (DT) technology emerges as a proactive and cost-effective approach for resource-limited networks. Mobile edge computing (MEC) is pivotal in facilitating mobile offloading, particularly under the demanding constraints of ultra-reliable and low-latency communication (URLLC). This study proposes an advanced bisection sampling-based stochastic solution enhancement (BSSE) algorithm to minimize the system’s overall energy-time cost by jointly optimizing task offloading and resource allocation strategies. The formulated problem is a mixed-integer nonlinear programming problem due to its inherently combinatorial linkage with task-offloading decisions and strong correlation with resource allocation. The proposed algorithm operates iteratively through the following steps: 1) narrowing the search space through a one-climb policy, 2) developing a closed-form solution for optimal CPU frequency and transmit power, and 3) implementing randomized task offloading, which updates it in the direction of reducing objective value. The scalability of the proposed algorithm is also analyzed for a two-device model, which is subsequently extended to multiple devices. Comparative analysis against benchmark schemes reveals that our approach reduces total energy-time cost by 15.35% to 33.12% when weighting parameter <inline-formula> <tex-math>$partial ^{lambda }_{k_{2}}$ </tex-math></inline-formula> is increased from 0.1 to 0.3, respectively.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 1","pages":"177-190"},"PeriodicalIF":5.3,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143430350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Beamforming Design for Cooperative Double-RIS Aided mmWave MU-MIMO Communications 协同双ris辅助毫米波MU-MIMO通信波束形成设计

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-12 DOI: 10.1109/TGCN.2024.3427126

Qing Xue;Renlong Wei;Zhidu Li;Yanping Liu;Yongjun Xu;Qianbin Chen

{"title":"Beamforming Design for Cooperative Double-RIS Aided mmWave MU-MIMO Communications","authors":"Qing Xue;Renlong Wei;Zhidu Li;Yanping Liu;Yongjun Xu;Qianbin Chen","doi":"10.1109/TGCN.2024.3427126","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3427126","url":null,"abstract":"This research delves into the design of collaborative beamforming for millimeter-wave (mmWave) multi-user multiple-input multiple-output (MU-MIMO) communications, which takes advantage of double reconfigurable intelligent surfaces (RISs) for enhanced signal transmission. The core objective is to jointly optimize the transmit beamforming at the base station and the phase shifts of the RISs to achieve the highest possible sum rate. To derive an efficient solution, the original problem is recast using the weighted minimum mean square error (WMMSE) approach, paving the way for an equivalent problem formulation. An effective alternating optimization strategy is introduced to tackle this problem, sequentially adjusting the transmit beamforming matrix and the RIS phase shifts for near-optimal results. In particular, a specialized WMMSE-based algorithm is devised for designing the transmit beamforming, while the passive beamforming of the RIS is optimized through semi-definite relaxation and majorization-minimization techniques. This balance ensures both high system performance and manageable computational load. Further analysis delves into the convergence properties and computational demands of the proposed methods. Simulation results are presented to validate the efficacy of the proposed algorithm and demonstrate the enhanced spectral efficiency achieved through the utilization of the double-RIS.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"645-657"},"PeriodicalIF":5.3,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi-Round Stackelberg Game-Based Pricing and Offloading in Containerized MEC Networks 集装箱MEC网络中基于多回合Stackelberg博弈的定价与卸载

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-12 DOI: 10.1109/TGCN.2024.3425643

Mingxiong Zhao;Zhaojie Yang;Zhenli He;Fanhao Xue;Xianqi Zhang

{"title":"Multi-Round Stackelberg Game-Based Pricing and Offloading in Containerized MEC Networks","authors":"Mingxiong Zhao;Zhaojie Yang;Zhenli He;Fanhao Xue;Xianqi Zhang","doi":"10.1109/TGCN.2024.3425643","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3425643","url":null,"abstract":"Mobile Edge Computing (MEC) tackles the challenges associated with the rapid proliferation of User Equipment (UE) and limited computing resources. Containerization, essential for MEC deployments, encapsulates applications and dependencies, optimizing resource utilization. In containerized MEC networks, UEs offload computational tasks to edge server containers, enabling service providers to profit from offering scalable and portable services, thereby establishing a symbiotic economic ecosystem. However, traditional models, which often separate cost and delay assessments, fail to consider these factors holistically. Furthermore, they underutilize the potential of container images’ hierarchical structure, which could optimize storage and reduce costs. Our research introduces a novel multi-round Stackelberg game framework that incorporates the hierarchical structure of container images to enhance resource management in MEC networks. Additionally, we integrate discount rates to model long-term economic interactions accurately, and develop two innovative algorithms: the Distributed Ant Colony Pricing (DACP) and the Multi-Round Simulated Annealing Pricing (MRSAP). These algorithms account for both immediate and long-term impacts, redefining user utility and significantly improving system efficiency. Simulation results validate the effectiveness of our algorithms in optimizing resource allocation and enhancing efficiency in dynamic MEC scenarios.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 1","pages":"191-206"},"PeriodicalIF":5.3,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143430355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Statistical Analysis and Energy-Efficient Routing for Tsunami Early Alarming in Internet of Underwater Things Using SDN Infrastructure 基于SDN的水下物联网海啸预警统计分析与节能路由

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-10 DOI: 10.1109/TGCN.2024.3426307

Shahrzad Sedaghat;Amir Hossein Jahangir

{"title":"Statistical Analysis and Energy-Efficient Routing for Tsunami Early Alarming in Internet of Underwater Things Using SDN Infrastructure","authors":"Shahrzad Sedaghat;Amir Hossein Jahangir","doi":"10.1109/TGCN.2024.3426307","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3426307","url":null,"abstract":"This paper presents a novel, energy-efficient routing approach for underwater sensor networks in tsunami early warning. Our system utilizes sensor nodes equipped with piezoelectric energy harvesting to extend network lifetime and stability. Continuous sensing is replaced with a duty-cycled approach to conserve energy, where the ocean surface is divided into regions and sensor nodes are grouped. These groups become active at designated intervals, while others remain dormant. The system leverages satellite networks to complement the underwater sensor network, enabling collected data to reach the central hub of early warning systems. A statistical analysis assigns scores to potential routes based on their energy consumption, prioritizing low-energy paths. Probability theory is employed to calculate the minimum number of transmission paths needed to achieve a predetermined level of reliability. A well-established tsunami wave prediction system is used to select the most suitable next hop for data transmission to avoid interference with tsunami wave propagation. Simulation results demonstrate significant improvements in energy efficiency, end-to-end delay, sensor and relay node lifespan, and network stability compared to recent research. These achievements highlight the effectiveness of our proposed routing approach in achieving energy efficiency and reliable data transmission within a tsunami early warning system.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"561-573"},"PeriodicalIF":5.3,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient Charging and Data Collection in UAV-Aided Backscatter Sensor Networks 无人机辅助后向散射传感器网络的高效充电与数据采集

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-10 DOI: 10.1109/TGCN.2024.3426356

Amit Goel;Nancy Varshney;Swades De

{"title":"Efficient Charging and Data Collection in UAV-Aided Backscatter Sensor Networks","authors":"Amit Goel;Nancy Varshney;Swades De","doi":"10.1109/TGCN.2024.3426356","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3426356","url":null,"abstract":"Backscatter communication based wireless charging of the sensor nodes and data collection from them is a promising solution due to ultra-low power consumption. However, challenges of short transmission range requirement, high self-interference, and simultaneous operation with multiple backscatter nodes (BSNs) need to be addressed. To this end, this paper presents a novel framework for joint field data collection and wireless charging in an unmanned aerial vehicle (UAV)-aided wireless sensor network via monostatic backscatter communication at millimeter waves. The framework is divided into three tasks, namely, energy-optimized UAV transceiver design, UAV constraints aware BSN clustering, and optimized resource allocation per cluster. To strike a balance between serving efficiency and self-interference, optimum BSN cluster size is estimated offline, which in turn governs BSN clustering optimization. With UAV communication energy and clustering information, a joint sum energy transfer and sum data collection maximization problem is formulated by considering the minimum required charging and data collection constraints. To handle non-convexity, an alternating optimization approach is devised, estimating optimal backscatter reflection coefficients, data collection time, and power distribution among the BSNs using successive convex approximation. Finally, via Monte-Carlo simulations, performance of the proposed system is compared with the current state-of-the-art.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"574-587"},"PeriodicalIF":5.3,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Toward Sustainable O-RAN Deployment: An In-Depth Analysis of Power Consumption 迈向可持续的O-RAN部署：电力消耗的深入分析

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-10 DOI: 10.1109/TGCN.2024.3426108

Gianmarco Baldini;Raffaele Bolla;Roberto Bruschi;Alessandro Carrega;Franco Davoli;Chiara Lombardo;Ramin Rabbani

{"title":"Toward Sustainable O-RAN Deployment: An In-Depth Analysis of Power Consumption","authors":"Gianmarco Baldini;Raffaele Bolla;Roberto Bruschi;Alessandro Carrega;Franco Davoli;Chiara Lombardo;Ramin Rabbani","doi":"10.1109/TGCN.2024.3426108","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3426108","url":null,"abstract":"5G delivers limitless mobile broadband capabilities, enabling extensive connectivity for various devices, including smartphones, sensors, and machines. Its most notable feature lies in its ability to facilitate instantaneous and highly reliable machine communications. Because of the rapid evolution of communication networks, innovative architectures such as Open RAN (O-RAN) have emerged, promising increased flexibility, efficiency, and sustainability. To realize the full potential of ORAN networks, however, it is critical to understand their power consumption implications. In this paper, in order to understand the way O-RAN consumes energy, a comprehensive power consumption model is used. The study not only provides theoretical analysis but also incorporates a practical implementation of the architecture. For this, an algorithm is employed to determine a base monolithic architecture of O-RAN by the placement of Distributed Unit (DU) and Centralized Unit (CU) using available data of Radio Unit (RU) in France and Ireland. The research further explores the impact of different parameter variations in various Evaluation Scenarios (ESs) on the architecture. By conducting this thorough evaluation, this research provides valuable insights for researchers and industry practitioners to gain a deeper understanding of energy consumption patterns and derive ideas on how to effectively reduce power consumption in these networks.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"429-444"},"PeriodicalIF":5.3,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10592054","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Federated Learning-Enabled Jamming Detection for Stochastic Terrestrial and Non-Terrestrial Networks 基于联邦学习的随机地面和非地面网络干扰检测

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-07-10 DOI: 10.1109/TGCN.2024.3425792

Aida Meftah;Tri Nhu Do;Georges Kaddoum;Chamseddine Talhi

{"title":"Federated Learning-Enabled Jamming Detection for Stochastic Terrestrial and Non-Terrestrial Networks","authors":"Aida Meftah;Tri Nhu Do;Georges Kaddoum;Chamseddine Talhi","doi":"10.1109/TGCN.2024.3425792","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3425792","url":null,"abstract":"In this paper, we present a novel federated learning (FL) algorithm, named Aggregated and Augmented Training Federated (AAT-Fed), tailored for stochastic, distributed, tactical terrestrial and non-terrestrial (SDT-TNT) network environments. Focusing on an SDT-TNT network with multiple clusters and potential unknown jammers, our approach addresses jammer detection through convolutional variational autoencoders (C-VAEs) within the FL framework. Leveraging the spectral correlation function (SCF) of the in-phase and quadrature (I/Q) representation of received signals, our method extracts discriminating features for jammer detection in the absence of prior knowledge about the jammers. AAT-Fed excels at managing the unique characteristics of the tactical TNT network, considering its stochastic nature and the heterogeneity in data distribution between network cells, leading to enhanced jamming detection accuracy. Comparative simulation results demonstrate AAT-Fed’s superior performance over FL and non-FL approaches, showcasing its effectiveness in providing accurate jamming detection at a low jamming-to-noise ratio.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 1","pages":"271-290"},"PeriodicalIF":5.3,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143430401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0