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

Is Fiber-to-the-Room (FTTR) Green? – Modeling and Analysis of Power and Energy Consumption 光纤到房间（FTTR）是绿色的吗？-电力和能源消耗的建模和分析

IF 5.3 2区计算机科学

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

Jinhan Cai;Gangxiang Shen;Jun Li;Sanjay Kumar Bose;Xiaolong Zhang;Hui Liu;Xiang Wang;Tianhai Chang

引用次数: 0

Relay Selection and Power Control for Mobile Underwater Acoustic Communication Networks: A Dual-Thread Reinforcement Learning Approach 移动水声通信网络中继选择与功率控制：一种双线强化学习方法

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-08-16 DOI: 10.1109/TGCN.2024.3445142

Jun Dai;Xinbin Li;Song Han;Junzhi Yu;Zhixin Liu

{"title":"Relay Selection and Power Control for Mobile Underwater Acoustic Communication Networks: A Dual-Thread Reinforcement Learning Approach","authors":"Jun Dai;Xinbin Li;Song Han;Junzhi Yu;Zhixin Liu","doi":"10.1109/TGCN.2024.3445142","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3445142","url":null,"abstract":"This paper deals with a cooperation communication problem (relay selection and power control) for mobile underwater acoustic communication networks. To achieve satisfactory transmission capacity, we propose a reinforcement-learning-based cooperation communication scheme to efficiently resist the highly dynamic communication links and strongly unknown time-varying channel states caused by the mobility of Autonomous Underwater Vehicles (AUVs). Firstly, a particular Markov decision process is developed to model the dynamic relay selection process of mobile AUV in the unknown scenario. In the developed model, an experimental statistical-based partition mechanism is proposed to cope with the greatly increasing dimension of the state space caused by the mobility of AUV, reducing the search optimization difficulty. Secondly, a dual-thread reinforcement learning structure with actual and virtual learning threads is proposed to efficiently track the superior relay action. In the actual learning thread, the proposed improved probability greedy policy enables the AUV to strengthen the exploration for the reward information of potential superior relays on the current state. Meanwhile, in the virtual learning thread, the proposed upper-confidence-bound-index-based uncertainty estimation method can estimate the action-reward level of historical states. Consequently, the combination of actual and virtual learning threads can efficiently obtain satisfactory Q value information, thereby making superior relay decision-making in a short time. Thirdly, a power control mechanism is proposed to reuse the current observed action-reward information and transform the multiple unknown parameter nonlinear joint power optimization problem into a convex optimization problem, thereby enhancing network transmission capacity. Finally, simulation results verify the effectiveness of the proposed scheme.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"698-710"},"PeriodicalIF":5.3,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117197","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

Information-Theoretic Study of Time-Domain Energy-Saving Techniques in Radio Access 无线接入时域节能技术的信息论研究

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-08-14 DOI: 10.1109/TGCN.2024.3443649

François Rottenberg

{"title":"Information-Theoretic Study of Time-Domain Energy-Saving Techniques in Radio Access","authors":"François Rottenberg","doi":"10.1109/TGCN.2024.3443649","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3443649","url":null,"abstract":"Reduction of wireless network energy consumption is becoming increasingly important to reduce environmental footprint and operational costs. A key concept to achieve it is the use of lean transmission techniques that dynamically (de)activate hardware resources as a function of the load. In this paper, we propose a pioneering information-theoretic study of time-domain energy-saving techniques, relying on a practical hardware power consumption model of sleep and active modes. By minimizing the power consumption under a quality of service constraint (rate, latency), we propose simple yet powerful techniques to allocate power and choose which resources to activate or to put in sleep mode. Power consumption scaling regimes are identified. We show that a “rush-to-sleep” approach (maximal power in fewest symbols followed by sleep) is optimal in a low-signal-to-noise ratio (SNR) regime. It is shown how consumption can be made linear with the load and achieve massive energy reduction (factor of 10) at low-to-medium load. The trade-off between energy efficiency (EE) and spectral efficiency (SE) is also characterized, followed by a multi-user study based on time division multiple access (TDMA).","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"605-620"},"PeriodicalIF":5.3,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117182","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

Evolutionary Game-Based Adaptive DT Association and Transfer for Wireless Computing Power Networks 基于进化博弈的无线计算能力网络自适应DT关联与传输

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-08-13 DOI: 10.1109/TGCN.2024.3442910

Yadong Zhang;Peng Wang;Qubeijian Wang;Haibin Zhang;Lexi Xu;Wen Sun;Bin Wang

{"title":"Evolutionary Game-Based Adaptive DT Association and Transfer for Wireless Computing Power Networks","authors":"Yadong Zhang;Peng Wang;Qubeijian Wang;Haibin Zhang;Lexi Xu;Wen Sun;Bin Wang","doi":"10.1109/TGCN.2024.3442910","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3442910","url":null,"abstract":"Wireless Computing Power Networks (WCPN), guided by green principles, aim to provide efficient, flexible, and environmentally friendly computing services for Internet of Things (IoT) applications by seamlessly coordinating computational and networking resources across diverse nodes. The integration of Digital Twin (DT) technology is crucial for achieving these objectives. However, different DT association strategies play a crucial role in enhancing the capabilities of WCPN. In this paper, recognizing the long-term and dynamic nature of DT deployment in real-world scenarios, we utilize evolutionary game theory to model the association and transfer of DTs, aiming for continuous adaptive adjustments and optimizations in their deployment. Specifically, we propose an evolutionary game-based algorithm for DT association as a complement to the independent decision-making process in DT deployment. Moreover, in light of the inherent limitations of the evolutionary game selection mechanism and the lack of self-learning ability, we introduce a deep Q-network (DQN) based evolutionary game approach that ensures adaptive DT association and transfer by considering factors such as DT synchronization delay, model consistency, and migration costs. Numerical results demonstrate that our proposed algorithms outperform the benchmarks in terms of average user utility and convergence speed.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"670-683"},"PeriodicalIF":5.3,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117415","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

Robust Design and Experimental Demonstration of RSS-Based Visible Light Positioning Under Limited Receiving FOV 有限接收视场下基于rss的可见光定位稳健设计与实验验证

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-08-13 DOI: 10.1109/TGCN.2024.3443086

Nuo Huang;Feng Chen;Changyuan Liu;Yan-Yu Zhang;Yi-Jun Zhu;Chen Gong

{"title":"Robust Design and Experimental Demonstration of RSS-Based Visible Light Positioning Under Limited Receiving FOV","authors":"Nuo Huang;Feng Chen;Changyuan Liu;Yan-Yu Zhang;Yi-Jun Zhu;Chen Gong","doi":"10.1109/TGCN.2024.3443086","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3443086","url":null,"abstract":"In this paper, we propose a robust received signal strength (RSS)-based indoor visible light positioning (VLP) scheme under limited receiving field-of-view (FOV). The position estimation in the time domain is complicated, and the time-frequency transform is first performed on the received time-domain signal to establish an equivalent frequency-domain RSS model, which simplifies the signal representation and problem solving. To realize robust VLP under limited receiving FOV, we consider the joint estimation of the receiver coordinate, light emitting diode (LED) validity indicator vector, signal phase vector and receiving coefficient based on the frequency-domain RSS vector. The original estimation problem is equivalently transformed into the optimization problem that maximizes the angle between the valid RSS modulus vector and the valid RSS feature vector. Experimental and simulation results verify the effectiveness of the proposed scheme under limited receiving FOV. Specifically, experimental results show that the proposed VLP scheme achieves a stable positioning accuracy below 5 cm under limited receiving FOV in a 60 cm <inline-formula> <tex-math>$times $ </tex-math></inline-formula> 60 cm positioning region with transceiver height 150 cm.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 1","pages":"392-403"},"PeriodicalIF":5.3,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403789","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

HSADR: A New Highly Secure Aggregation and Dropout-Resilient Federated Learning Scheme for Radio Access Networks With Edge Computing Systems HSADR：一种适用于带有边缘计算系统的无线接入网络的新型高度安全聚合和抗病毒联合学习方案

IF 5.3 2区计算机科学

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

Fan Wu;Xiong Li;Jingwei Li;Pandi Vijayakumar;Brij B. Gupta;Varsha Arya

引用次数: 0

Physical Layer Authentication via Conditional Variational Auto-Encoder for AIS 基于条件变分自编码器的AIS物理层认证

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-08-06 DOI: 10.1109/TGCN.2024.3439536

Qi Jiang;Jin Sha

{"title":"Physical Layer Authentication via Conditional Variational Auto-Encoder for AIS","authors":"Qi Jiang;Jin Sha","doi":"10.1109/TGCN.2024.3439536","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3439536","url":null,"abstract":"Automatic identification system (AIS) with satellite components is exposed to increasing external attackers due to its high degree of openness. Radio frequency fingerprint identification (RFFI) offers a new perspective on AIS security solutions as a physical layer authentication scheme. However, existing RFFI methods are constrained by sensitivity to noise or interference, and these methods are cumbersome to tune when directly applied to satellite AIS (SAT-AIS). To this end, this paper proposes an RFFI method based on a conditional variational auto-encoder (CVAE). Specifically, the fractional lower-order cyclic spectrum as an extension of the conventional cyclic spectrum is used as a feature transformation to highlight the RFF features in the time-frequency domain. In addition, CVAE with multiple attention mechanisms is used to adaptively compress and extract discriminative RFF features to improve the RFFI accuracy. Experimental results show that the proposed method can yield 98.28% accuracy at <inline-formula> <tex-math>$E_{b}/N_{0}$ </tex-math></inline-formula> of 10 dB, with high reliability and robustness under noise environment.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"513-521"},"PeriodicalIF":5.3,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117177","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-Tree-Based Avoidance Multicast Routing for Wireless Sensor Networks 基于多树的无线传感器网络回避组播路由

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-08-06 DOI: 10.1109/TGCN.2024.3436011

Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku

{"title":"Multi-Tree-Based Avoidance Multicast Routing for Wireless Sensor Networks","authors":"Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku","doi":"10.1109/TGCN.2024.3436011","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3436011","url":null,"abstract":"Multi-path avoidance routing for wireless sensor networks (WSNs) is a secure routing paradigm against adversaries with unbounded computational power. The key idea of avoidance routing is to encode a message into several pieces by the XOR coding, and each piece is routed via different paths. Then, an adversary cannot obtain the original message unless she eavesdrops on all message pieces from all the paths. In this paper, we extend such an approach into secure multicast routing, which is a one-to-many communication primitive. To this end, we propose the multi-tree-based avoidance multicast routing protocol (AMRP) for WSNs, in which a set of adversary disjoint trees is discovered, i.e., a set of multicast trees with no common adversaries. When a set of multicast trees is adversary disjoint, no adversary can eavesdrop on all message pieces to recover the original message. In addition, optimized AMRP (OAMRP) is proposed in order to reduce the control overhead of AMRP, where additional multicast trees are used for only a subset of destination nodes with no single safe tree. The simulation results demonstrate that the proposed protocols achieve higher secure delivery rates than a simple extension of the existing unicast avoidance routing protocol.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"484-497"},"PeriodicalIF":5.3,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117440","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

Willingness Allocation-Assisted Cooperative Localization Algorithm Based on Competitive Game for Resource-Constrained Environment 资源约束环境下基于竞争博弈的意愿分配辅助协同定位算法

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-08-01 DOI: 10.1109/TGCN.2024.3436535

Geng Chen;Lili Cheng;Qingtian Zeng;Fei Shen;Yu-Dong Zhang

{"title":"Willingness Allocation-Assisted Cooperative Localization Algorithm Based on Competitive Game for Resource-Constrained Environment","authors":"Geng Chen;Lili Cheng;Qingtian Zeng;Fei Shen;Yu-Dong Zhang","doi":"10.1109/TGCN.2024.3436535","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3436535","url":null,"abstract":"With the rapid development of Internet of Things (IoT) technology, cooperative positioning is gradually becoming a key technology improving the localization performance without any infrastructure change. However, the game balance problem of positioning accuracy and resource consumption in resource-constrained scenarios remains challenging. To address these issues, we propose a cooperative positioning algorithm based on Competitive Game (CG) for optimization power management subject to the power budgets, and then adopt the Cooperative Willingness Allocation Rule (CWAR) to further improve positioning accuracy. Firstly, a clustering algorithm is applied to form a node cluster with the target node <italic>k</i> as the cluster head for node selection and power allocation conveniently. Secondly, a new energy management strategy based on competitive game is proposed to minimize square position error bound of each agent individually with penalization by its power cost. The optimal response equilibrium point of Nash equilibrium is obtained by using the proposed CG algorithm to develop a solution for energy management games combining global information. Moreover, a fairness aware CWAR is proposed, which uses an improved Shapley value to proportionally distribute the cooperative willingness among the reference agents based on each node’s contribution for further expanding the location information of the agent nodes. The experimental results have shown that the proposed algorithm has an excellent performance in position accuracy and resource consumption. Compared with the Average, Random, Link Bargaining Equilibrium(LBE) and Price Allocation Rule (PAR) algorithms, the proposed algorithm improves the positioning accuracy by 38.50%, 49.00%, 31.55% and 17.08%, respectively. Meanwhile, compared with the Exhaustive, Random, LBE and PAR algorithm, the proposed algorithm reduced resource consumption by 87.50%, 69.80%, 57.58% and 63.89% respectively.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"498-512"},"PeriodicalIF":5.3,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117441","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

Orthogonal Pattern Division Multiple Access Utilizing Optimal Frequency Hopping Patterns Constructed With Welch Costas Arrays 利用Welch Costas阵列构造的最优跳频方向图的正交方向图分割多址

IF 5.3 2区计算机科学

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

Jianguo Yao;Rui Jiang;Xiaoming Wang;Ziwei Liu

{"title":"Orthogonal Pattern Division Multiple Access Utilizing Optimal Frequency Hopping Patterns Constructed With Welch Costas Arrays","authors":"Jianguo Yao;Rui Jiang;Xiaoming Wang;Ziwei Liu","doi":"10.1109/TGCN.2024.3434962","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3434962","url":null,"abstract":"This paper explores the autocorrelation and cross-correlation properties of Welch Costas arrays and introduces a method for constructing optimal frequency hopping patterns with ideal autocorrelation and cross-correlation through two-dimensional cyclic shift on a Welch Costas array. Additionally, it proposes orthogonal pattern division multiple access (OPDMA) utilizing these optimal patterns. The paper examines the relationship between the design parameters of these patterns and cellular system parameters, tailoring frequency hopping patterns for cellular system users. Furthermore, it conducts computations and analyses on the autocorrelation and cross-correlation of the designed patterns, demonstrating their ideal properties. It also discusses the role of delay distance and Doppler distance in achieving ideal cross-correlation between the optimal frequency hopping patterns. OPDMA emerges as a novel two-dimensional orthogonal multiple access technology offering signal immunity, effectively overcoming interference from multipath propagation, Doppler shift, and inter-user interference. This simplifies receiver design and enhances overall system performance, presenting potential applications in future cellular mobile communications, frequency hopping communications, radar, and sonar systems.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"471-483"},"PeriodicalIF":5.3,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117442","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