Guangyuan Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Guangyuan Zheng has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Miaowen Wen
South China University of Technology
8 shared publications - Chen Xu
School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications - Xiongwen Zhao
School of Electrical and Electronic Engineering, North China Electric Power University, Beijing, China
2 shared publications - Yingyang Chen
College of Information Science and Technology, Jinan University, Guangzhou, China
2 shared publications Zhiguo Ding
Department of Electrical Engineering and Computer Science, Khalifa University, Abu Dhabi, United Arab Emirates
2 shared publications- Chun Shan
School of Electronics and Information, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication
Latest Publications
- Open Access
- 1 August 2025
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 11 (4) , 1262-1270
Enhancing generalized receive spatial modulation by symbol-level precoding: Design guidelines with or without intelligent reflecting surfaces
- 1 August 2025
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 11 (4) , 1262-1270
Open AccessEnhancing generalized receive spatial modulation by symbol-level precoding: Design guidelines with or without intelligent reflecting surfaces
- 4 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (9) , 7226-7239
Trading Computing Power for Reducing Communication Loads: A Semantic Communication Perspective
As a new paradigm focusing on transmitting the meaning of information, semantic communications (SCs) have been revealed significant potential in alleviating network congestion and improving energy efficiency. By extracting a small-size semantic feature from the large-size raw-data, the communication loads can be reduced at a price of more computing power, i.e., the computational resource used in semantic extraction. In this paper, we explore the computation dimension to improve the communication performance in an uplink SC system. The SC-oriented user first compresses its original data via local computing during other users’ transmission time and then transmits it to the base station within the assigned time. To achieve a balanced tradeoff between communications and computing, we formulate an optimization problem to minimize the energy consumption of all users by jointly considering the compression ratio and time allocation. We first propose an efficient general algorithm that can be applied to different SC models. To gain more insights, we then derive the closed-form solutions for two special cases: equal-time allocation and two-user transmission. The obtained analytical results reveal a pronounced energy saving of adopting SC, especially for large transmitted data size, high transmission energy coefficient, scarce time resources, and poor channel conditions. Simulation results reveal that our proposed SC-based scheme achieves excellent performance in terms of saving energy consumption compared to the conventional communication.
- 4 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (9) , 7226-7239
Trading Computing Power for Reducing Communication Loads: A Semantic Communication Perspective
As a new paradigm focusing on transmitting the meaning of information, semantic communications (SCs) have been revealed significant potential in alleviating network congestion and improving energy efficiency. By extracting a small-size semantic feature from the large-size raw-data, the communication loads can be reduced at a price of more computing power, i.e., the computational resource used in semantic extraction. In this paper, we explore the computation dimension to improve the communication performance in an uplink SC system. The SC-oriented user first compresses its original data via local computing during other users’ transmission time and then transmits it to the base station within the assigned time. To achieve a balanced tradeoff between communications and computing, we formulate an optimization problem to minimize the energy consumption of all users by jointly considering the compression ratio and time allocation. We first propose an efficient general algorithm that can be applied to different SC models. To gain more insights, we then derive the closed-form solutions for two special cases: equal-time allocation and two-user transmission. The obtained analytical results reveal a pronounced energy saving of adopting SC, especially for large transmitted data size, high transmission energy coefficient, scarce time resources, and poor channel conditions. Simulation results reveal that our proposed SC-based scheme achieves excellent performance in terms of saving energy consumption compared to the conventional communication.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (4) , 2693-2706
Computation-Aware Offloading for DNN Inference Tasks in Semantic Communication Assisted MEC Systems
In this paper, we focus on computation-aware offloading for executing deep neural network (DNN) inference tasks in a mobile edge computing (MEC) system. To cope with the challenges of insufficient wireless resources during task offloading, we resort to semantic communications (SCs), through which the users can offload the compressed task data to the edge server for remote execution. Specifically, we establish the relationship between the compression ratio and computation ratio for different DNN tasks. To achieve energy-efficient offloading, we formulate an optimization problem to minimize the energy consumption of all users by jointly optimizing the compression ratio, computation allocation, uploading time, and DNN layer selection. We first consider a special case with the preconfigured time scheduling and derive closed-form solutions to computation allocation and offloading time, which yield a threshold-based structure determined by users’ channel conditions and local computation consumption. Inspired by the characteristics of these optimal solutions, a general low-complexity iterative algorithm is then designed to solve the original non-convex problem. Simulation results demonstrate that our proposed SC-based computation -offloading scheme can substantially reduce users’ energy consumption compared to the conventional offloading and full offloading, especially with scarce wireless resources.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (4) , 2693-2706
Computation-Aware Offloading for DNN Inference Tasks in Semantic Communication Assisted MEC Systems
In this paper, we focus on computation-aware offloading for executing deep neural network (DNN) inference tasks in a mobile edge computing (MEC) system. To cope with the challenges of insufficient wireless resources during task offloading, we resort to semantic communications (SCs), through which the users can offload the compressed task data to the edge server for remote execution. Specifically, we establish the relationship between the compression ratio and computation ratio for different DNN tasks. To achieve energy-efficient offloading, we formulate an optimization problem to minimize the energy consumption of all users by jointly optimizing the compression ratio, computation allocation, uploading time, and DNN layer selection. We first consider a special case with the preconfigured time scheduling and derive closed-form solutions to computation allocation and offloading time, which yield a threshold-based structure determined by users’ channel conditions and local computation consumption. Inspired by the characteristics of these optimal solutions, a general low-complexity iterative algorithm is then designed to solve the original non-convex problem. Simulation results demonstrate that our proposed SC-based computation -offloading scheme can substantially reduce users’ energy consumption compared to the conventional offloading and full offloading, especially with scarce wireless resources.
- 25 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (4) , 1034-1038
Joint Hybrid Precoding and Rate Allocation for RSMA in Near-Field and Far-Field Massive MIMO Communications
In this letter, we propose to apply rate-splitting multiple access (RSMA) to improve the system’s spectral efficiency (SE) and manage the severe multi-user interference in the mixed near- and far-field communication system. Specifically, RSMA is utilized to serve all near-field and far-field users on the same time-frequency resource. To further explore the potential of RSMA, we consider the user selection to design the optimal rate-splitting strategy. To this end, we formulate an optimization problem to maximize the sum SE via the joint consideration of user selection, hybrid precoding, and rate allocation. For tackling this non-convex problem, we propose an alternative optimization algorithm based on successive convex approximation and simulated annealing methods. Simulation results reveal that our proposed algorithm achieves a larger performance gain than the other competing benchmark schemes in terms of SE improvement.
- 25 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (4) , 1034-1038
Joint Hybrid Precoding and Rate Allocation for RSMA in Near-Field and Far-Field Massive MIMO Communications
In this letter, we propose to apply rate-splitting multiple access (RSMA) to improve the system’s spectral efficiency (SE) and manage the severe multi-user interference in the mixed near- and far-field communication system. Specifically, RSMA is utilized to serve all near-field and far-field users on the same time-frequency resource. To further explore the potential of RSMA, we consider the user selection to design the optimal rate-splitting strategy. To this end, we formulate an optimization problem to maximize the sum SE via the joint consideration of user selection, hybrid precoding, and rate allocation. For tackling this non-convex problem, we propose an alternative optimization algorithm based on successive convex approximation and simulated annealing methods. Simulation results reveal that our proposed algorithm achieves a larger performance gain than the other competing benchmark schemes in terms of SE improvement.
- 2 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (21) , 34140-34155
Novel Over-the-Air Federated Learning via Reconfigurable Intelligent Surface and SWIPT
To provide sustainable energy support while meeting the demands for serving a rapidly increasing number of devices, in this article, we propose a new reconfigurable intelligent surface (RIS)-assisted simultaneous wireless information and power transfer (SWIPT) and over-the-air computation (AirComp) federated learning (FL) system which is termed RAPID. Specifically, at each training iteration, an access point (AP) first simultaneously broadcasts global model and transfers wireless energy to the selected devices via the RIS-assisted SWIPT. These devices then use the harvested power to compute and upload their local gradients to the AP for aggregation via the RIS-assisted AirComp. To identify the performance improvement to FL, we first analyze and derive the expected convergence rate for the proposed RAPID system taking into account factors of device selection and wireless communication. We then formulate a joint learning-communication optimization problem in terms of device selection, transmit beamforming, power splitting, receive beamforming, and RIS coefficients design. To solve the formulated nonconvex problem, we propose a new two-stage algorithm by successively solving the downlink SWIPT and the uplink AirComp subproblems based on alternating optimization and successive convex approximation techniques. Simulation results are presented to demonstrate that our proposed RAIPD system can significantly improve the convergence and accuracy of FL compared with benchmark schemes.
- 2 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (21) , 34140-34155
Novel Over-the-Air Federated Learning via Reconfigurable Intelligent Surface and SWIPT
To provide sustainable energy support while meeting the demands for serving a rapidly increasing number of devices, in this article, we propose a new reconfigurable intelligent surface (RIS)-assisted simultaneous wireless information and power transfer (SWIPT) and over-the-air computation (AirComp) federated learning (FL) system which is termed RAPID. Specifically, at each training iteration, an access point (AP) first simultaneously broadcasts global model and transfers wireless energy to the selected devices via the RIS-assisted SWIPT. These devices then use the harvested power to compute and upload their local gradients to the AP for aggregation via the RIS-assisted AirComp. To identify the performance improvement to FL, we first analyze and derive the expected convergence rate for the proposed RAPID system taking into account factors of device selection and wireless communication. We then formulate a joint learning-communication optimization problem in terms of device selection, transmit beamforming, power splitting, receive beamforming, and RIS coefficients design. To solve the formulated nonconvex problem, we propose a new two-stage algorithm by successively solving the downlink SWIPT and the uplink AirComp subproblems based on alternating optimization and successive convex approximation techniques. Simulation results are presented to demonstrate that our proposed RAIPD system can significantly improve the convergence and accuracy of FL compared with benchmark schemes.
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (3) , 2413-2427
Rate-Splitting Multiple Access in Wireless Backhaul HetNets: A Decentralized Spectral Efficient Approach
In this paper, we investigate the application of rate-splitting multiple access (RSMA) in a two-tier wireless backhaul heterogeneous network (HetNet), where a macro base station (MBS) simultaneously transmits wireless access signals to multiple macro-cell users (MCUs) and wireless backhaul signals to small base stations (SBSs) by leveraging RSMA. Furthermore, to explore the potential advantage of common streams in RSMA systems, we develop a “Hybrid RSMA” scheme in which the MBS only employs RSMA to encode the backhaul messages while each MCU’s message is directly encoded without rate-splitting. We formulate an optimization problem to maximize the system’s spectral efficiency (SE) by jointly considering transmit precoding and rate allocation at the MBS and SBSs. To solve the formulated non-convex problem, we first propose an iterative centralized algorithm based on successive convex approximation (SCA). Then, we further develop an efficient decentralized algorithm that can be executed in parallel at the MBS and each SBS based on the local channel state information with fewer signaling exchanges. Simulation results show that the application of RSMA can achieve higher SE over conventional non-orthogonal multiple access (NOMA) and space division multiple access (SDMA) under different network loads. Particularly, “Hybrid RSMA” has a greater performance improvement than “RSMA” in the underloaded system.
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (3) , 2413-2427
Rate-Splitting Multiple Access in Wireless Backhaul HetNets: A Decentralized Spectral Efficient Approach
In this paper, we investigate the application of rate-splitting multiple access (RSMA) in a two-tier wireless backhaul heterogeneous network (HetNet), where a macro base station (MBS) simultaneously transmits wireless access signals to multiple macro-cell users (MCUs) and wireless backhaul signals to small base stations (SBSs) by leveraging RSMA. Furthermore, to explore the potential advantage of common streams in RSMA systems, we develop a “Hybrid RSMA” scheme in which the MBS only employs RSMA to encode the backhaul messages while each MCU’s message is directly encoded without rate-splitting. We formulate an optimization problem to maximize the system’s spectral efficiency (SE) by jointly considering transmit precoding and rate allocation at the MBS and SBSs. To solve the formulated non-convex problem, we first propose an iterative centralized algorithm based on successive convex approximation (SCA). Then, we further develop an efficient decentralized algorithm that can be executed in parallel at the MBS and each SBS based on the local channel state information with fewer signaling exchanges. Simulation results show that the application of RSMA can achieve higher SE over conventional non-orthogonal multiple access (NOMA) and space division multiple access (SDMA) under different network loads. Particularly, “Hybrid RSMA” has a greater performance improvement than “RSMA” in the underloaded system.
- 17 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (10) , 10934-10947
Service Caching Based Aerial Cooperative Computing and Resource Allocation in Multi-UAV Enabled MEC Systems
Service caching refers to caching the necessary programs or/and the related databases for performing computational tasks at edge servers, which has been considered to save both computation and communication resources in mobile edge computing (MEC) systems. In this paper, we investigate computation service caching in a multi-unmanned aerial vehicle (UAV) enabled MEC system, where each UAV equipped with an edge server acts as an aerial computing platform to serve the ground devices. Furthermore, the UAVs can serve the devices cooperatively through the provided computing and caching resources. Aiming at minimizing the maximum task completion latency among all devices, we formulate a joint service caching, task offloading, communication and computation resource allocation, as well as UAV placement optimization problem, while guaranteeing the energy budget of all devices and UAVs. The problem is a mixed integer non-linear programming problem, and we decompose it into four sub-problems, and then propose an iterative algorithm based on block coordinate descent (BCD) and successive convex approximation (SCA) techniques to obtain near-optimal solution. Numerical results show that our proposed algorithm can achieve lower task completion latency than other baselines while guaranteeing better fairness among all devices.
- 17 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (10) , 10934-10947
Service Caching Based Aerial Cooperative Computing and Resource Allocation in Multi-UAV Enabled MEC Systems
Service caching refers to caching the necessary programs or/and the related databases for performing computational tasks at edge servers, which has been considered to save both computation and communication resources in mobile edge computing (MEC) systems. In this paper, we investigate computation service caching in a multi-unmanned aerial vehicle (UAV) enabled MEC system, where each UAV equipped with an edge server acts as an aerial computing platform to serve the ground devices. Furthermore, the UAVs can serve the devices cooperatively through the provided computing and caching resources. Aiming at minimizing the maximum task completion latency among all devices, we formulate a joint service caching, task offloading, communication and computation resource allocation, as well as UAV placement optimization problem, while guaranteeing the energy budget of all devices and UAVs. The problem is a mixed integer non-linear programming problem, and we decompose it into four sub-problems, and then propose an iterative algorithm based on block coordinate descent (BCD) and successive convex approximation (SCA) techniques to obtain near-optimal solution. Numerical results show that our proposed algorithm can achieve lower task completion latency than other baselines while guaranteeing better fairness among all devices.
- 16 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (6) , 1166-1170
Interference Exploitation for Ambient Backscatter Communication Networks via Symbol Level Precoding
Although ambient backscatter communications (AmBCs) are capable of achieving high spectrum- and energy-efficiency in numerous cutting-edge Internet-of-Things applications, the legacy user devices (UDs) will suffer from severe interference caused by the backscatter device (BD). In this letter, we leverage the symbol level precoding (SLP) technique to convert the harmful interference perceived at the UD into a useful signal, thereby improving the communication quality of the legacy users. Specifically, we consider an AmBC system where one access point (AP) simultaneously transmits information to all UDs and receives the BD’s reflected signal. To reduce the power consumption of the AP, we formulate a joint transmit SLP and receive beamforming optimization problem while guaranteeing the quality of service of all UDs and the BD. An efficient algorithm is proposed to solve the formulated non-convex problem. Simulation results show that the proposed SLP scheme can achieve superior performance over conventional beamforming schemes in the sense of saving power consumption.
- 16 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (6) , 1166-1170
Interference Exploitation for Ambient Backscatter Communication Networks via Symbol Level Precoding
Although ambient backscatter communications (AmBCs) are capable of achieving high spectrum- and energy-efficiency in numerous cutting-edge Internet-of-Things applications, the legacy user devices (UDs) will suffer from severe interference caused by the backscatter device (BD). In this letter, we leverage the symbol level precoding (SLP) technique to convert the harmful interference perceived at the UD into a useful signal, thereby improving the communication quality of the legacy users. Specifically, we consider an AmBC system where one access point (AP) simultaneously transmits information to all UDs and receives the BD’s reflected signal. To reduce the power consumption of the AP, we formulate a joint transmit SLP and receive beamforming optimization problem while guaranteeing the quality of service of all UDs and the BD. An efficient algorithm is proposed to solve the formulated non-convex problem. Simulation results show that the proposed SLP scheme can achieve superior performance over conventional beamforming schemes in the sense of saving power consumption.
- 25 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 6 (3) , 1889-1902
Socially-Aware Energy-Efficient Task Partial Offloading in MEC Networks With D2D Collaboration
The future wireless network will face demands of massive connectivity and intensive computation with the increase of mobile devices. Mobile edge computing (MEC) and Device-to-Device (D2D) have emerged as promising technologies to address the above challenges, and implementing social relationships in D2D-MEC networks can improve the reliability of D2D links. Exploiting these benefits, we investigate the energy-efficient task offloading problem in socially-aware D2D-assisted MEC networks, where the user devices can offload tasks to the nearby device or further forward to the MEC server based on social relationships. Specifically, we design a task partial offloading scheme of joint D2D connection selection, transmit power control and task allocation, to maximize the long-term network utility with considering dynamic system status and random task arrival. First, the social relationship among users is quantified into a social trust matrix. As the formulated socially-aware energy-efficient problem is a long-term stochastic optimization problem that is directly intractable, we thus employ the Lyapunov optimization to transform it into a series of short-term problems, each of which can be solved by the Karush-Kuhn-Tucker method and a pricing-based matching algorithm. Finally, we verify the performance optimality and the long-term network stability through numerical simulations as well as theoretical analysis.
- 25 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 6 (3) , 1889-1902
Socially-Aware Energy-Efficient Task Partial Offloading in MEC Networks With D2D Collaboration
The future wireless network will face demands of massive connectivity and intensive computation with the increase of mobile devices. Mobile edge computing (MEC) and Device-to-Device (D2D) have emerged as promising technologies to address the above challenges, and implementing social relationships in D2D-MEC networks can improve the reliability of D2D links. Exploiting these benefits, we investigate the energy-efficient task offloading problem in socially-aware D2D-assisted MEC networks, where the user devices can offload tasks to the nearby device or further forward to the MEC server based on social relationships. Specifically, we design a task partial offloading scheme of joint D2D connection selection, transmit power control and task allocation, to maximize the long-term network utility with considering dynamic system status and random task arrival. First, the social relationship among users is quantified into a social trust matrix. As the formulated socially-aware energy-efficient problem is a long-term stochastic optimization problem that is directly intractable, we thus employ the Lyapunov optimization to transform it into a series of short-term problems, each of which can be solved by the Karush-Kuhn-Tucker method and a pricing-based matching algorithm. Finally, we verify the performance optimality and the long-term network stability through numerical simulations as well as theoretical analysis.
- Open Access
- 2 March 2021
- Published by MDPI AG in Algorithms
- Vol. 14 (3) , 80
D2D Assisted Cellular Networks in Licensed and Unlicensed Spectrum: Matching-Iteration-Based Joint User Access and Resource Allocation
Device-to-Device (D2D) communications, which enable direct communication between nearby user devices over the licensed spectrum, have been considered a key technique to improve spectral efficiency and system throughput in cellular networks (CNs). However, the limited spectrum resources cannot be sufficient to support more cellular users (CUs) and D2D users to meet the growth of the traffic data in future wireless networks. Therefore, Long-Term Evolution-Unlicensed (LTE-U) and D2D-Unlicensed (D2D-U) technologies have been proposed to further enhance system capacity by extending the CUs and D2D users on the unlicensed spectrum for communications. In this paper, we consider an LTE network where the CUs and D2D users are allowed to share the unlicensed spectrum with Wi-Fi users. To maximize the sum rate of all users while guaranteeing each user’s quality of service (QoS), we jointly consider user access and resource allocation. To tackle the formulated problem, we propose a matching-iteration-based joint user access and resource allocation algorithm. Simulation results show that the proposed algorithm can significantly improve system throughput compared to the other benchmark algorithms.
- 2 March 2021
- Published by MDPI AG in Algorithms
- Vol. 14 (3) , 80
Open AccessD2D Assisted Cellular Networks in Licensed and Unlicensed Spectrum: Matching-Iteration-Based Joint User Access and Resource Allocation
Device-to-Device (D2D) communications, which enable direct communication between nearby user devices over the licensed spectrum, have been considered a key technique to improve spectral efficiency and system throughput in cellular networks (CNs). However, the limited spectrum resources cannot be sufficient to support more cellular users (CUs) and D2D users to meet the growth of the traffic data in future wireless networks. Therefore, Long-Term Evolution-Unlicensed (LTE-U) and D2D-Unlicensed (D2D-U) technologies have been proposed to further enhance system capacity by extending the CUs and D2D users on the unlicensed spectrum for communications. In this paper, we consider an LTE network where the CUs and D2D users are allowed to share the unlicensed spectrum with Wi-Fi users. To maximize the sum rate of all users while guaranteeing each user’s quality of service (QoS), we jointly consider user access and resource allocation. To tackle the formulated problem, we propose a matching-iteration-based joint user access and resource allocation algorithm. Simulation results show that the proposed algorithm can significantly improve system throughput compared to the other benchmark algorithms.