Pub Date : 2024-11-26DOI: 10.1109/TGCN.2024.3506153
{"title":"2024 Index IEEE Transactions on Green Communications and Networking Vol. 8","authors":"","doi":"10.1109/TGCN.2024.3506153","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3506153","url":null,"abstract":"","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1-35"},"PeriodicalIF":5.3,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10768869","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713816","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}
Pub Date : 2024-11-19DOI: 10.1109/TGCN.2024.3454935
Yijie Mao;Bruno Clerckx;Derrick Wing Kwan Ng;Wolfgang Utschick;Ying Cui;Timothy N. Davidson
{"title":"Guest Editorial Special Issue on Rate-Splitting Multiple Access for Future Green Communication Networks","authors":"Yijie Mao;Bruno Clerckx;Derrick Wing Kwan Ng;Wolfgang Utschick;Ying Cui;Timothy N. Davidson","doi":"10.1109/TGCN.2024.3454935","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3454935","url":null,"abstract":"","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1291-1292"},"PeriodicalIF":5.3,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10758386","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672003","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}
Pub Date : 2024-11-19DOI: 10.1109/TGCN.2024.3494575
{"title":"IEEE Transactions on Green Communications and Networking","authors":"","doi":"10.1109/TGCN.2024.3494575","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3494575","url":null,"abstract":"","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"C2-C2"},"PeriodicalIF":5.3,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10758387","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672040","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}
Pub Date : 2024-11-19DOI: 10.1109/TGCN.2024.3494577
{"title":"IEEE Communications Society Information","authors":"","doi":"10.1109/TGCN.2024.3494577","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3494577","url":null,"abstract":"","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"C3-C3"},"PeriodicalIF":5.3,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10758388","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142679361","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}
Pub Date : 2024-08-28DOI: 10.1109/TGCN.2024.3443722
{"title":"IEEE Transactions on Green Communications and Networking","authors":"","doi":"10.1109/TGCN.2024.3443722","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3443722","url":null,"abstract":"","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 3","pages":"C2-C2"},"PeriodicalIF":5.3,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654696","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090896","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}
Pub Date : 2024-08-28DOI: 10.1109/TGCN.2024.3441148
Kapal Dev;Chih-Lin I;Raouf Boutaba;Sunder Ali Khowaja;Shao-Yu Lien;Yue Wang
{"title":"Guest Editorial Special Issue on Green Open Radio Access Networks: Architecture, Challenges, Opportunities, and Use Cases","authors":"Kapal Dev;Chih-Lin I;Raouf Boutaba;Sunder Ali Khowaja;Shao-Yu Lien;Yue Wang","doi":"10.1109/TGCN.2024.3441148","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3441148","url":null,"abstract":"","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 3","pages":"891-894"},"PeriodicalIF":5.3,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654697","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090827","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}
Pub Date : 2024-08-28DOI: 10.1109/TGCN.2024.3443724
{"title":"IEEE Communications Society Information","authors":"","doi":"10.1109/TGCN.2024.3443724","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3443724","url":null,"abstract":"","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 3","pages":"C3-C3"},"PeriodicalIF":5.3,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654690","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142123060","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}
Pub Date : 2024-08-12DOI: 10.1109/TGCN.2024.3441532
Fan Wu;Xiong Li;Jingwei Li;Pandi Vijayakumar;Brij B. Gupta;Varsha Arya
Open radio access network (ORAN) plays a critical role in modern communication process. The structure that individual devices connect each other via ORAN turns to be a part of smart city. Incorporating with the concept Internet of Things (IoT), cloud-edge-client architecture has been accepted to discuss artificial intelligence (AI) coordinating functions in ORAN. Considering the security for ORAN in critical infrastructure, federated learning (FL) is an effective way to protect the original data on individual devices. However, recent schemes failed to support enough security features. To tackle the problem, we present a new highly secure aggregation and dropout-resilient FL scheme called HSADR which incorporates consortium blockchain and differential privacy to maintain the security environment. Second, we prove that the aggregation process reaches the IND-CCA2 security level, which is the first scheme to complete this goal. Last, experiments show that HSADR withstands common test aspects.
开放无线接入网（ORAN）在现代通信过程中发挥着至关重要的作用。各个设备通过 ORAN 相互连接的结构成为智慧城市的一部分。结合物联网（IoT）概念，云-边缘-客户端架构已被接受，用于讨论 ORAN 中的人工智能（AI）协调功能。考虑到关键基础设施中 ORAN 的安全性，联合学习（FL）是保护单个设备上原始数据的有效方法。然而，最近的方案未能支持足够的安全功能。为了解决这个问题，我们提出了一种名为 HSADR 的新型高安全性聚合和抗辍学 FL 方案，该方案结合了联盟区块链和差分隐私来维护安全环境。其次，我们证明了聚合过程达到了 IND-CCA2 安全等级，这是第一个完成这一目标的方案。最后，实验表明 HSADR 经受住了常见测试方面的考验。
{"title":"HSADR: A New Highly Secure Aggregation and Dropout-Resilient Federated Learning Scheme for Radio Access Networks With Edge Computing Systems","authors":"Fan Wu;Xiong Li;Jingwei Li;Pandi Vijayakumar;Brij B. Gupta;Varsha Arya","doi":"10.1109/TGCN.2024.3441532","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3441532","url":null,"abstract":"Open radio access network (ORAN) plays a critical role in modern communication process. The structure that individual devices connect each other via ORAN turns to be a part of smart city. Incorporating with the concept Internet of Things (IoT), cloud-edge-client architecture has been accepted to discuss artificial intelligence (AI) coordinating functions in ORAN. Considering the security for ORAN in critical infrastructure, federated learning (FL) is an effective way to protect the original data on individual devices. However, recent schemes failed to support enough security features. To tackle the problem, we present a new highly secure aggregation and dropout-resilient FL scheme called HSADR which incorporates consortium blockchain and differential privacy to maintain the security environment. Second, we prove that the aggregation process reaches the IND-CCA2 security level, which is the first scheme to complete this goal. Last, experiments show that HSADR withstands common test aspects.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 3","pages":"1141-1155"},"PeriodicalIF":5.3,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090718","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}
Digital Twin for Vehicular Networks (DTVN) continuously simulates and optimizes vehicle behaviors to support emerging 6G Internet-of-Vehicle (IoV) applications such as DT-assisted autonomous driving. To meet Quality of Service (QoS), resource scheduling for distributed vehicle DTs is carried out. However, existing works mainly respond to service demand based on one-to-one DT synchronization and computation offloading, which limits the service response quality and is not sustainable. Meanwhile, twin objects need to be frequently transferred at edges in parallel with the moving vehicles, the IoV service demand response under high-dynamic DT resource distribution is challenging. In this paper, a novel digital twin function virtualization (DTFV) architecture based on Open Radio Access Networks (O-RAN) is proposed. In DTFV, multiple vehicle DTs following one-to-one synchronization are decoupled and reorganized as a Virtualized Digital Twin (VDT) following dissemination-based synchronization for dynamic service response, without needs for offloading service to additional edge devices. Besides, to optimize the overall IoV service response profit, we propose an asynchronous hierarchical reinforcement learning (AHRL)-based DTFV resource scheduling scheme to find optimal VDT orchestration and synchronization strategies. Finally, experimental results show our scheme achieves 8.48% higher service response profit and 6.8% lower VDT synchronization delay over the best baseline scheme.
{"title":"O-RAN-Based Digital Twin Function Virtualization for Sustainable IoV Service Response: An Asynchronous Hierarchical Reinforcement Learning Approach","authors":"Yihang Tao;Jun Wu;Qianqian Pan;Ali Kashif Bashir;Marwan Omar","doi":"10.1109/TGCN.2024.3435796","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3435796","url":null,"abstract":"Digital Twin for Vehicular Networks (DTVN) continuously simulates and optimizes vehicle behaviors to support emerging 6G Internet-of-Vehicle (IoV) applications such as DT-assisted autonomous driving. To meet Quality of Service (QoS), resource scheduling for distributed vehicle DTs is carried out. However, existing works mainly respond to service demand based on one-to-one DT synchronization and computation offloading, which limits the service response quality and is not sustainable. Meanwhile, twin objects need to be frequently transferred at edges in parallel with the moving vehicles, the IoV service demand response under high-dynamic DT resource distribution is challenging. In this paper, a novel digital twin function virtualization (DTFV) architecture based on Open Radio Access Networks (O-RAN) is proposed. In DTFV, multiple vehicle DTs following one-to-one synchronization are decoupled and reorganized as a Virtualized Digital Twin (VDT) following dissemination-based synchronization for dynamic service response, without needs for offloading service to additional edge devices. Besides, to optimize the overall IoV service response profit, we propose an asynchronous hierarchical reinforcement learning (AHRL)-based DTFV resource scheduling scheme to find optimal VDT orchestration and synchronization strategies. Finally, experimental results show our scheme achieves 8.48% higher service response profit and 6.8% lower VDT synchronization delay over the best baseline scheme.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 3","pages":"1049-1060"},"PeriodicalIF":5.3,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090868","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}
Pub Date : 2024-07-25DOI: 10.1109/TGCN.2024.3433507
De Mi;Hongzhi Chen;Zheng Chu;Pei Xiao;Yiyan Wu;Chin-Liang Wang
Rate Splitting Multiple Access (RSMA) precoder design with the practical finite-alphabet constellations instead of Gaussian inputs has been addressed in this paper. Considering a multiuser (MU) multiple-input single-output (MISO) broadcast channel (BC) system, we derive a generalized expression of the achievable rate for each user, in a way that the derived expression is generically applicable, e.g., for both underloaded and overloaded cases. Building upon the achievable rate expression, we formulate a multi-objective problem that maximizes the weighted sum rate (WSR) of the considered system, which incorporates with the optimization of the RS precoder for both common and private symbol streams in RSMA. The emphasis here is that our derivation of the achievable rate expression, the problem formulation of the WSR and the optimization of the RSMA precoder all involve the finite alphabet constellation constraint. An iterative gradient descent algorithm with alternative optimization and line search methods is applied to solve the optimization problem. Numerical results show that RSMA can reach the maximum achievable WSR, under both underloaded and overloaded scenarios, with less transmit power compared to the traditional schemes, e.g., space division multiple access (SDMA) and power-domain non-orthogonal multiple access (NOMA). Moreover, thanks to its flexibility, RSMA subsumes both SDMA and NOMA as its subset to fit into different scenarios such as underloaded and overloaded cases with different constellation sizes.
{"title":"Rate-Splitting Multiple Access With Finite-Alphabet Constellations: Precoder Optimization and Achievable Rate Performance","authors":"De Mi;Hongzhi Chen;Zheng Chu;Pei Xiao;Yiyan Wu;Chin-Liang Wang","doi":"10.1109/TGCN.2024.3433507","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3433507","url":null,"abstract":"Rate Splitting Multiple Access (RSMA) precoder design with the practical finite-alphabet constellations instead of Gaussian inputs has been addressed in this paper. Considering a multiuser (MU) multiple-input single-output (MISO) broadcast channel (BC) system, we derive a generalized expression of the achievable rate for each user, in a way that the derived expression is generically applicable, e.g., for both underloaded and overloaded cases. Building upon the achievable rate expression, we formulate a multi-objective problem that maximizes the weighted sum rate (WSR) of the considered system, which incorporates with the optimization of the RS precoder for both common and private symbol streams in RSMA. The emphasis here is that our derivation of the achievable rate expression, the problem formulation of the WSR and the optimization of the RSMA precoder all involve the finite alphabet constellation constraint. An iterative gradient descent algorithm with alternative optimization and line search methods is applied to solve the optimization problem. Numerical results show that RSMA can reach the maximum achievable WSR, under both underloaded and overloaded scenarios, with less transmit power compared to the traditional schemes, e.g., space division multiple access (SDMA) and power-domain non-orthogonal multiple access (NOMA). Moreover, thanks to its flexibility, RSMA subsumes both SDMA and NOMA as its subset to fit into different scenarios such as underloaded and overloaded cases with different constellation sizes.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1293-1307"},"PeriodicalIF":5.3,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672045","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：