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

Jointly Power Control and Scheduling in Underwater Wireless Sensor Networks With Oblivious Freshness Requirement 具有未知新鲜度要求的水下无线传感器网络中的联合功率控制与调度

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-04-02 DOI: 10.1109/TGCN.2024.3384294

Yuchao Chen;Jintao Wang;Jun Du;Jian Song

{"title":"Jointly Power Control and Scheduling in Underwater Wireless Sensor Networks With Oblivious Freshness Requirement","authors":"Yuchao Chen;Jintao Wang;Jun Du;Jian Song","doi":"10.1109/TGCN.2024.3384294","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3384294","url":null,"abstract":"This paper considers an underwater wireless sensor network where a sink station collects time-sensitive information from multiple sensors. For timely monitoring, the sink station aims to maximize the data freshness of the entire network. The difficulty includes time-varying channel states, limited transmission bandwidth and power consumption caused by underwater acoustic communication. Moreover, due to the time-varying service requirements, the importance of data is unknown until it is received and processed by the sink station. To overcome these difficulties, we characterize the data freshness at the terminal through a set of non-decreasing functions with respect to the popular metric Age of Information (AoI). To save the energy consumption, each sensor will transmit with different power to combat the different channel states. Then, we relax the bandwidth constraint and resort to the online learning framework with Lyapunov drift analysis to design a jointly scheduling and power control algorithm based on historical observations. The algorithm is proven to achieve the sub-linear expected performance for both cumulative age regret and bandwidth violation. Finally, we propose the truncated scheduling strategy to satisfy the hard bandwidth constraint. Simulation results validate the performance of the proposed algorithms compared with the optimal offline algorithm with complete information.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1398-1412"},"PeriodicalIF":5.3,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672102","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

CPNN Algorithm for Adaptive Beamforming 用于自适应波束成形的 CPNN 算法

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-03-31 DOI: 10.1109/TGCN.2024.3407980

Fulai Liu;Xuefei Sun;Zhibo Su;Ruiyan Du;Yufeng Du;Xiuquan Dou;Aiyi Zhang;Guozhu Sun

{"title":"CPNN Algorithm for Adaptive Beamforming","authors":"Fulai Liu;Xuefei Sun;Zhibo Su;Ruiyan Du;Yufeng Du;Xiuquan Dou;Aiyi Zhang;Guozhu Sun","doi":"10.1109/TGCN.2024.3407980","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3407980","url":null,"abstract":"This paper presents an effective adaptive beamforming method based on a complex-valued processing neural network (CPNN), named as CPNN algorithm. In the proposed method, the optimal beamforming problem can be formulated as a regression problem of neural networks (NNs). In the CPNN structure, a new real-imaginary merging (RIM) layer and a new imaginary-real merging (IRM) layer are constructed to process complex-valued data with other layers. Via the RIM and IRM layers, the complex-valued data computation in the neurons follows the complex-valued multiplication rule, which makes the mathematical relationship between the input and output of the NN-based beamformer more reasonable. Compared with the previous works in NNs, the proposed CPNN approach provides better beamforming performance, for example, 1) the phase information of the complex-valued data is maintained, which makes the output of the NN-based beamformer more accurate; 2) it does not require prior information of the desired signal, such as the desired direction of arrival, which will avoid errors caused by signal parameters estimation; and 3) it can not only effectively suppress the interference signals but also ensure that the response of the desired signal is distortionless. Simulation results demonstrate the efficiency of the presented approach.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1521-1529"},"PeriodicalIF":5.3,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672034","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

Coordinated Link Adaptation for an Energy-Efficient Full-Duplex Random Access Network 高能效全双工随机存取网络的协调链路自适应

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-03-31 DOI: 10.1109/TGCN.2024.3407764

Huu-Hung Tran;Ji-Hoon Yun

{"title":"Coordinated Link Adaptation for an Energy-Efficient Full-Duplex Random Access Network","authors":"Huu-Hung Tran;Ji-Hoon Yun","doi":"10.1109/TGCN.2024.3407764","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3407764","url":null,"abstract":"In this paper, we develop a coordinated link adaptation scheme to maximize the energy efficiency of a full-duplex (FD) random access network when self-interference cancellation (SIC) is imperfect. First, we model the energy consumption of an FD link and formulate an energy-consumption-per-bit minimization problem with the constellation size of the link as a problem variable. Via numerical results, the model shows that the optimal constellation size of an FD link strongly depends on not only the communication distance but also the SIC capability and data length. Then, we extend the formulation to the energy-consumption minimization problem for an FD random access network. A conservative delay budget for saturated traffic conditions is obtained in terms of the constellation sizes of the associated devices. Finally, the network coordination problem for the constellation sizes is formulated as a nonlinear problem with integer constraints on the constellation sizes, and a solution algorithm for this problem is designed, employing the successive convex approximation method. A comparative evaluation with representative conventional schemes demonstrates that the proposed scheme significantly outperforms the conventional schemes in terms of the energy consumption per bit for a wide range of network environments.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1692-1706"},"PeriodicalIF":5.3,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713766","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

Cooperative Throughput Maximization in a Multi-Cluster WPCN 多集群 WPCN 中的合作吞吐量最大化

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-03-30 DOI: 10.1109/TGCN.2024.3407522

Omid Rezaei;Maryam Masjedi;Mohammad Mahdi Naghsh;Saeed Gazor;Mohammad Mahdi Nayebi

{"title":"Cooperative Throughput Maximization in a Multi-Cluster WPCN","authors":"Omid Rezaei;Maryam Masjedi;Mohammad Mahdi Naghsh;Saeed Gazor;Mohammad Mahdi Nayebi","doi":"10.1109/TGCN.2024.3407522","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3407522","url":null,"abstract":"This paper investigates a multi-cluster Wireless Powered Communication Network (WPCN) where user clusters cooperate with a Cluster Head (CH) and a Hybrid Access Point (HAP). Employing beamforming, the HAP supplies energy in the downlink phase, while users transmit signals to the HAP and CHs in the uplink phase. We optimize the Energy Beamforming (EB) matrix, user transmit covariance matrices, and time slot allocation to enhance both max-min and sum network throughput. To tackle the non-convexity of the optimization problems, we decompose them into two subproblems and reformulate each as convex Second Order Cone Programming (SOCP) and Quadratic Constraint Quadratic Programming (QCQP) for the max-min and sum throughput problems, respectively. Notably, we account for imperfections in Channel State Information (CSI) and non-linear Energy Harvesting (EH) circuits. Additionally, we incorporate the active Intelligent Reflecting Surfaces (IRS) as a key component in our proposed method. Numerical examples illustrate the significant impact of these contributions across various scenarios.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1505-1520"},"PeriodicalIF":5.3,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142671998","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

Joint Gray-Mapping for Multilayer Multicast NOMA With Arbitrary Modulation Orders 具有任意调制阶数的多层多播 NOMA 的联合灰度映射

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-03-30 DOI: 10.1109/TGCN.2024.3407523

Hamad Yahya;Emad Alsusa;Arafat Al-Dweik

{"title":"Joint Gray-Mapping for Multilayer Multicast NOMA With Arbitrary Modulation Orders","authors":"Hamad Yahya;Emad Alsusa;Arafat Al-Dweik","doi":"10.1109/TGCN.2024.3407523","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3407523","url":null,"abstract":"This work considers the design of a generalized Gray-mapping process to multilayer multicast non-orthogonal multiple access (NOMA) transmission with arbitrary modulation orders. Unlike orthogonal multiple access (OMA), joint-multilayer Gray-mapping (J-Gray) can provide significant energy savings and bit error rate (BER) improvements, which can be used to alleviate the degradation caused by the inherent multilayer interference in NOMA. The obtained improvement is due to the increased Euclidean distance that Gray-mapping provides for certain layers/symbols. To evaluate the impact of Gray-mapping, closed-form expressions are derived for the exact BER with imperfect successive interference cancellation (SIC). The obtained analytical and simulation results demonstrate that the proposed scheme can offer up to 10 dB gain and 94% energy saving compared to conventional NOMA in certain scenarios, where such a performance gain can be shared between the layers by selecting an appropriate power assignment (PA). Moreover, feasibility maps are generated to demonstrate the additional flexibility that Gray-mapping can offer in terms of quality of service (QoS) satisfaction for the various layers at lower signal to noise ratio (SNR).","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1762-1780"},"PeriodicalIF":5.3,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713891","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

An IR-HARQ Based RSMA for Reliable and Low-Latency Communication 基于 IR-HARQ 的 RSMA，实现可靠和低延迟通信

IF 5.3 2区计算机科学

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

Shaima Abidrabbu;Sawaira Rafaqat Ali;H. M. Furqan;Hüseyin Arslan

{"title":"An IR-HARQ Based RSMA for Reliable and Low-Latency Communication","authors":"Shaima Abidrabbu;Sawaira Rafaqat Ali;H. M. Furqan;Hüseyin Arslan","doi":"10.1109/TGCN.2024.3406803","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3406803","url":null,"abstract":"In rate-splitting multiple access (RSMA) networks, high reliability is critical, and one efficient way to improve reliability is to use a hybrid automated repeat request (HARQ) protocol. However, the challenge lies in designing the HARQ in RSMA networks due to the combining and splitting procedures at the transmitter side. In this paper, we propose a novel transmission approach based on incremental redundancy (IR) that is also equivalent to the HARQ protocol for RSMA networks. The proposed strategy opens up a new path for RSMA networks where HARQ is challenging or cannot be applied. In particular, a redundancy version (RV) of each user’s private data is constructed and placed in the common stream by making use of common stream properties such as transmitting it non-orthogonally with higher power, alongside the private stream. The efficacy of the proposed design is examined through various metrics, encompassing average transmission rate, outage analysis, energy efficiency (EE), and diversity order. Simulation results validate the superior performance of the proposed protocol, showcasing a significant improvement of up to 60%, 23%, and 79% in terms of packet error rate, average waiting time, and EE respectively, compared to the conventional HARQ RSMA.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1308-1317"},"PeriodicalIF":5.3,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672044","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

Companding and Predistortion Techniques for Improved Efficiency and Performance in SWIPT 提高 SWIPT 效率和性能的压缩和预失真技术

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-03-27 DOI: 10.1109/TGCN.2024.3405627

Santiago Fernández;F. Javier López-Martínez;Fernando H. Gregorio;Juan Cousseau

引用次数: 0

Dynamic User Association and Computation Offloading in Satellite Edge Computing Networks via Deep Reinforcement Learning 通过深度强化学习实现卫星边缘计算网络中的动态用户关联和计算卸载

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-03-26 DOI: 10.1109/TGCN.2024.3357813

Hangyu Zhang;Hongbo Zhao;Rongke Liu;Xiangqiang Gao;Shenzhan Xu

{"title":"Dynamic User Association and Computation Offloading in Satellite Edge Computing Networks via Deep Reinforcement Learning","authors":"Hangyu Zhang;Hongbo Zhao;Rongke Liu;Xiangqiang Gao;Shenzhan Xu","doi":"10.1109/TGCN.2024.3357813","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3357813","url":null,"abstract":"Satellite mobile edge computing (SMEC) deployed on ultra-dense low Earth orbit (LEO) satellites with high throughput and low latency can provide ubiquitous computing services closer to the user side. However, considering the highly dynamic and limited resources of LEO constellations, a joint strategy for accessing and offloading of ground users becomes difficult under overlapping satellite coverage. In this paper, a joint optimization method of dynamic user association and computation offloading for SMEC is proposed. Terrestrial users with random and diverse tasks adaptively access the optimal associated satellite under time-varying channel conditions, and offload to a satellite with sufficient remaining computing capability for load balancing in the SMEC network with inter-satellite cooperation. Furthermore, an evolutionary algorithm based on deep Q-network (DQN) is designed to jointly optimize the decisions of associated and offloading satellites and the allocation of computing resources, which enables energy-efficient strategies while meeting task latency and SMEC resource constraints. The method learns multi-dimensional actions intelligently and synchronously by improving network structure. The simulation results show that the proposed scheme can effectively reduce the system energy consumption by ensuring that the task is completed on demand, and outperform the benchmark algorithms.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1888-1901"},"PeriodicalIF":5.3,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713939","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

Distributed Adaptive Sampled-Data Security Tracking Control for Uncertain Heterogeneous Multi-Agents Systems Under DoS Attacks DoS 攻击下不确定异构多代理系统的分布式自适应采样数据安全跟踪控制

IF 5.3 2区计算机科学

IEEE Transactions on Green Communications and Networking Pub Date : 2024-03-25 DOI: 10.1109/TGCN.2024.3381346

Ning Zhao;Michael Shi;Xudong Zhao;Guangdeng Zong;Huiyan Zhang

{"title":"Distributed Adaptive Sampled-Data Security Tracking Control for Uncertain Heterogeneous Multi-Agents Systems Under DoS Attacks","authors":"Ning Zhao;Michael Shi;Xudong Zhao;Guangdeng Zong;Huiyan Zhang","doi":"10.1109/TGCN.2024.3381346","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3381346","url":null,"abstract":"This paper addresses the issue of secure distributed consensus tracking control for uncertain heterogeneous multi-agent systems (MASs) under synchronous sampled communication and intermittent denial-of-service (DoS) attacks. Considering that DoS attacks intermittently block the sampled data signal, a new packet update sequence is established to describe the transmitted signal to the neighbor agents. By virtue of the leader’s dynamics, the sampled-data-based distributed observer is established to observe the leader’s information for all followers. Then, based on the estimated signals and employing neural network approximation approach, secure adaptive sampled-data control strategy is proposed to compensate for the effects of uncertainty and DoS attacks. By utilizing novel Lyapunov-Krasovskii approach, the consensus tracking errors are regulated in the neighborhood around the origin. Finally, a numerical example with the coupled pendulums is provided to substantiate the efficiency of the proposed approach to achieve tracking security performance.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1385-1397"},"PeriodicalIF":5.3,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672050","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

Rate-Splitting Multiple Access for Secure Communications Over CR MISO SWIPT Systems With Non-Linear EH Users 有非线性 EH 用户的 CR MISO SWIPT 系统上安全通信的速率分割多重接入

IF 5.3 2区计算机科学

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

Carla E. Garcia;Mario R. Camana;Jorge Querol;Symeon Chatzinotas

{"title":"Rate-Splitting Multiple Access for Secure Communications Over CR MISO SWIPT Systems With Non-Linear EH Users","authors":"Carla E. Garcia;Mario R. Camana;Jorge Querol;Symeon Chatzinotas","doi":"10.1109/TGCN.2024.3404891","DOIUrl":"https://doi.org/10.1109/TGCN.2024.3404891","url":null,"abstract":"In this paper, we investigate a secure transmission for a rate-splitting multiple-access (RSMA)-based multiple-input single-output (MISO) underlay cognitive radio (CR) system. The proposed network is composed of a set of secondary users (SUs) that utilize simultaneous wireless information and power transfer (SWIPT) technology and an additional set of non-linear energy harvesting (EH) users. Moreover, the system model under consideration is exposed to multiple eavesdroppers. Thus, we propose to minimize the transmit power intended to the SUs and EH users while maximizing the artificial noise (AN) generated by the secondary transmitter, aiming to counter eavesdroppers’ wiretaps while satisfying the quality-of-service constraints. Therefore, we develop a novel approach based on ant colony regression (ACOR) and semidefinite relaxation (SDR) methods to solve the challenging and non-convex problem which is further transformed into a bilevel optimization problem. Afterward, we investigate a comparative solution based on the particle swarm optimization (PSO) algorithm, the successive convex approximation (SCA) technique, and analyze the incidence of linear and non-linear EH designs. In addition, we compare the RSMA-based scheme with non-orthogonal multiple-access (NOMA), space-division multiple access (SDMA), and zero-forcing (ZF) techniques. Satisfactorily, simulation results prove the proposed ACOR-SDR framework achieves better performance and lower complexity than its counterparts.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1332-1347"},"PeriodicalIF":5.3,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10538011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672002","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