Zezu Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zezu Liang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yuan Liu
School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China
5 shared publications - Kaibin Huang
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
3 shared publications - Tat-Ming Lok
The Chinese University of Hong Kong
3 shared publications - Fangjiong Chen
South China University of Technology
1 shared publication - Hanbiao Chen
School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China
1 shared publication - Qingqing Wu
Shanghai Jiao Tong University
1 shared publication
Latest Publications
- 14 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-13
User Association for Reconfigurable Intelligent Surfaces Aided Cell-Free Networks
Cell-free (CF) network can efficiently suppress inter-cell interference and enable multiple base stations (BSs) to serve users cooperatively without being affected by cell boundaries. However, to further increase the network capacity, a large number of BSs need to be deployed, resulting in high cost and power consumption. To tackle this problem, reconfigurable intelligent surface (RIS) has emerged as a cost-effective technology to enhance energy and spectral efficiency of wireless communications. In this paper, we consider an RIS-aided CF network by exploiting their complementary advantages where each user assisted by a dedicated RIS can associate with multiple BSs. We first characterize each user's average signal-to-interference-plus-noise ratio (SINR) in the RIS-CF network. Then, we formulate an SINR balancing problem to maximize the minimum SINR among all users by designing the BS-user associations. Despite of the non-convexity and combinatorial feature of this problem, a two-step fractional linearization algorithm is developed to solve it optimally. Specifically, we transform a nested mixed-integer linear fractional program (MILFP) into a solvable mixed-integer linear programming (MILP) problem through the generalized fractional programming and reformulation-linearization method. Finally, we provide numerical results to validate the effectiveness of our proposed algorithm compared to other benchmark schemes.
- 14 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-13
User Association for Reconfigurable Intelligent Surfaces Aided Cell-Free Networks
Cell-free (CF) network can efficiently suppress inter-cell interference and enable multiple base stations (BSs) to serve users cooperatively without being affected by cell boundaries. However, to further increase the network capacity, a large number of BSs need to be deployed, resulting in high cost and power consumption. To tackle this problem, reconfigurable intelligent surface (RIS) has emerged as a cost-effective technology to enhance energy and spectral efficiency of wireless communications. In this paper, we consider an RIS-aided CF network by exploiting their complementary advantages where each user assisted by a dedicated RIS can associate with multiple BSs. We first characterize each user's average signal-to-interference-plus-noise ratio (SINR) in the RIS-CF network. Then, we formulate an SINR balancing problem to maximize the minimum SINR among all users by designing the BS-user associations. Despite of the non-convexity and combinatorial feature of this problem, a two-step fractional linearization algorithm is developed to solve it optimally. Specifically, we transform a nested mixed-integer linear fractional program (MILFP) into a solvable mixed-integer linear programming (MILP) problem through the generalized fractional programming and reformulation-linearization method. Finally, we provide numerical results to validate the effectiveness of our proposed algorithm compared to other benchmark schemes.
- 13 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 10981-10995
A Two-Timescale Approach to Mobility Management for Multicell Mobile Edge Computing
Mobile edge computing (MEC) is a promising technology for enhancing the computation capacities and features of mobile users by offloading complex computation tasks to the edge servers. However, mobility poses great challenges on delivering reliable MEC service required for latency-critical applications. First, mobility management has to tackle the dynamics of both user’s location changes and task arrivals that vary in different timescales. Second, user mobility could induce service migration, leading to reliability loss due to the migration delay. In this paper, we propose a two-timescale mobility management framework by joint control of service migration and transmission power to address the above challenges. Specifically, the service migration operates at a large timescale to support user mobility in the multi-cell network, while the power control is performed at a small timescale for real-time task offloading. Their joint control is formulated as an optimization problem aiming at the long-term mobile energy minimization subject to the reliability requirement of computation offloading. To solve the problem, we propose a Lyapunov-based framework to decompose the problem into different timescales, based on which a low-complexity two-timescale online algorithm is developed by exploiting the problem structure. The proposed online algorithm is shown to be asymptotically optimal via theoretical analysis, and is further developed to accommodate the multiuser management. The simulation results demonstrate that our proposed algorithm can significantly improve the energy and reliability performance.
- 13 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 10981-10995
A Two-Timescale Approach to Mobility Management for Multicell Mobile Edge Computing
Mobile edge computing (MEC) is a promising technology for enhancing the computation capacities and features of mobile users by offloading complex computation tasks to the edge servers. However, mobility poses great challenges on delivering reliable MEC service required for latency-critical applications. First, mobility management has to tackle the dynamics of both user’s location changes and task arrivals that vary in different timescales. Second, user mobility could induce service migration, leading to reliability loss due to the migration delay. In this paper, we propose a two-timescale mobility management framework by joint control of service migration and transmission power to address the above challenges. Specifically, the service migration operates at a large timescale to support user mobility in the multi-cell network, while the power control is performed at a small timescale for real-time task offloading. Their joint control is formulated as an optimization problem aiming at the long-term mobile energy minimization subject to the reliability requirement of computation offloading. To solve the problem, we propose a Lyapunov-based framework to decompose the problem into different timescales, based on which a low-complexity two-timescale online algorithm is developed by exploiting the problem structure. The proposed online algorithm is shown to be asymptotically optimal via theoretical analysis, and is further developed to accommodate the multiuser management. The simulation results demonstrate that our proposed algorithm can significantly improve the energy and reliability performance.
- 1 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (6) , 4497-4508
Data Sensing and Offloading in Edge Computing Networks: TDMA or NOMA?
With the development of Internet-of-Things (IoT), we witness the explosive growth in the number of devices with sensing, computing, and communication capabilities, along with a large amount of raw data generated at the network edge. Mobile (multi-access) edge computing (MEC), acquiring and processing data at network edge (like base station (BS)) via wireless links, has emerged as a promising technique for real-time applications. In this paper, we consider the scenario that multiple devices sense then offload data to an edge server/BS, and the offloading throughput maximization problems are studied by joint radio-and-computation resource allocation, based on time-division multiple access (TDMA) and non-orthogonal multiple access (NOMA) multiuser computation offloading. Particularly, we take the sequence of TDMA-based multiuser transmission/offloading into account. The studied problems are NP-hard and non-convex. A set of low-complexity algorithms are designed based on decomposition approach and exploration of valuable insights of problems. They are either optimal or can achieve close-to-optimal performance as shown by simulation. The comprehensive simulation results show that the sequence-optimized TDMA scheme achieves better throughput performance than the NOMA scheme, while the NOMA scheme is better under the assumptions of time-sharing strategy and the identical sensing capability of the devices.
- 1 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (6) , 4497-4508
Data Sensing and Offloading in Edge Computing Networks: TDMA or NOMA?
With the development of Internet-of-Things (IoT), we witness the explosive growth in the number of devices with sensing, computing, and communication capabilities, along with a large amount of raw data generated at the network edge. Mobile (multi-access) edge computing (MEC), acquiring and processing data at network edge (like base station (BS)) via wireless links, has emerged as a promising technique for real-time applications. In this paper, we consider the scenario that multiple devices sense then offload data to an edge server/BS, and the offloading throughput maximization problems are studied by joint radio-and-computation resource allocation, based on time-division multiple access (TDMA) and non-orthogonal multiple access (NOMA) multiuser computation offloading. Particularly, we take the sequence of TDMA-based multiuser transmission/offloading into account. The studied problems are NP-hard and non-convex. A set of low-complexity algorithms are designed based on decomposition approach and exploration of valuable insights of problems. They are either optimal or can achieve close-to-optimal performance as shown by simulation. The comprehensive simulation results show that the sequence-optimized TDMA scheme achieves better throughput performance than the NOMA scheme, while the NOMA scheme is better under the assumptions of time-sharing strategy and the identical sensing capability of the devices.
- 12 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (9) , 5898-5912
Multi-Cell Mobile Edge Computing: Joint Service Migration and Resource Allocation
Mobile-edge computing (MEC) enhances the capacities and features of mobile devices by offloading computation-intensive tasks over wireless networks to edge servers. One challenge faced by the deployment of MEC in cellular networks is to support user mobility. As a result, offloaded tasks can be seamlessly migrated between base stations (BSs) without compromising the resource-utilization efficiency and link reliability. In this paper, we tackle the challenge by optimizing the policy for migration/handover between BSs by jointly managing computation-and-radio resources. The objectives are twofold: maximizing the sum offloading rate, quantifying MEC throughput, and minimizing the migration cost. The policy design is formulated as a decision-optimization problem that accounts for virtualization, I/O interference between virtual machines (VMs), and wireless multi-access. To solve the complex combinatorial problem, we develop an efficient relaxation-and-rounding based solution approach. The approach relies on an optimal iterative algorithm for solving the integer-relaxed problem and a novel integer-recovery design. The latter outperforms the traditional rounding method by exploiting the derived problem properties and applying matching theory. In addition, we also consider the design for a special case of “hotspot mitigation”, referring to alleviating an overloaded server/BS by migrating its load to the nearby idle servers/BSs. From simulation results, we observed close-to-optimal performance of the proposed migration policies under various settings. This demonstrates their efficiency in computation-and-radio resource management for joint service migration and BS handover in multi-cell MEC networks.
- 12 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (9) , 5898-5912
Multi-Cell Mobile Edge Computing: Joint Service Migration and Resource Allocation
Mobile-edge computing (MEC) enhances the capacities and features of mobile devices by offloading computation-intensive tasks over wireless networks to edge servers. One challenge faced by the deployment of MEC in cellular networks is to support user mobility. As a result, offloaded tasks can be seamlessly migrated between base stations (BSs) without compromising the resource-utilization efficiency and link reliability. In this paper, we tackle the challenge by optimizing the policy for migration/handover between BSs by jointly managing computation-and-radio resources. The objectives are twofold: maximizing the sum offloading rate, quantifying MEC throughput, and minimizing the migration cost. The policy design is formulated as a decision-optimization problem that accounts for virtualization, I/O interference between virtual machines (VMs), and wireless multi-access. To solve the complex combinatorial problem, we develop an efficient relaxation-and-rounding based solution approach. The approach relies on an optimal iterative algorithm for solving the integer-relaxed problem and a novel integer-recovery design. The latter outperforms the traditional rounding method by exploiting the derived problem properties and applying matching theory. In addition, we also consider the design for a special case of “hotspot mitigation”, referring to alleviating an overloaded server/BS by migrating its load to the nearby idle servers/BSs. From simulation results, we observed close-to-optimal performance of the proposed migration policies under various settings. This demonstrates their efficiency in computation-and-radio resource management for joint service migration and BS handover in multi-cell MEC networks.
- 19 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 18 (9) , 4298-4311
Multiuser Computation Offloading and Downloading for Edge Computing With Virtualization
- 19 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 18 (9) , 4298-4311
Multiuser Computation Offloading and Downloading for Edge Computing With Virtualization