Tat-Ming Lok

Tat-Ming Lok

Auto-generated profile, based on publicly available information

Tat-Ming Lok

Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong, China

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 April 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZLZezu Liang
Zezu Liang
YLYuan Liu
Yuan Liu
TLTat-Ming Lok
Tat-Ming Lok
KHKaibin Huang
Kaibin Huang
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 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZLZezu Liang
Zezu Liang
YLYuan Liu
Yuan Liu
TLTat-Ming Lok
Tat-Ming Lok
KHKaibin Huang
Kaibin Huang

6 January 2025 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YTYao Tang
Yao Tang
GZGuangxu Zhu
Guangxu Zhu
WXWei Xu
Wei Xu
MCMan Hon Cheung
Man Hon Cheung
TLTat-Ming Lok
Tat-Ming Lok
SCShuguang Cui
Shuguang Cui
Federated edge learning (FEEL) enables privacy-preserving model training through periodic communication between edge devices and the server. Unmanned Aerial Vehicle (UAV)-mounted edge devices are particularly advantageous for FEEL due to their flexibility and mobility in efficient data collection. In UAV-assisted FEEL, sensing, computation, and communication are coupled and compete for limited onboard resources, and UAV deployment also affects sensing and communication performance. Therefore, the joint design of UAV deployment and resource allocation is crucial to achieving the optimal training performance. In this paper, we address the problem of joint UAV deployment design and resource allocation for FEEL via a concrete case study of human motion recognition based on wireless sensing. We first analyze the impact of UAV deployment on the sensing quality and identify a threshold value for the sensing elevation angle that guarantees a satisfactory quality of data samples. Due to the non-ideal sensing channels, we consider the probabilistic sensing model, where the successful sensing probability of each UAV is determined by its position. Then, we derive the upper bound of the FEEL training loss as a function of the sensing probability. Theoretical results suggest that the convergence rate can be improved if UAVs have a uniform successful sensing probability. Based on this analysis, we formulate a training time minimization problem by jointly optimizing UAV deployment, integrated sensing, computation, and communication (ISCC) resources under a desirable optimality gap constraint. To solve this challenging mixed-integer non-convex problem, we apply the alternating optimization technique, and propose the bandwidth, batch size, and position optimization (BBPO) scheme to optimize these three decision variables alternately. Simulation results demonstrate that our BBPO scheme outperforms other baseline schemes regarding convergence rate and testing accuracy. The simulation implementation is available at https://github.com/TheaSherlock/ISCC-UAV.

13 July 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZLZezu Liang
Zezu Liang
YLYuan Liu
Yuan Liu
TLTat-Ming Lok
Tat-Ming Lok
KHKaibin Huang
Kaibin Huang
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.

2 August 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YTYao Tang
Yao Tang
MCMan Hon Cheung
Man Hon Cheung
TLTat-Ming Lok
Tat-Ming Lok
UAV-assisted communication is a promising paradigm to enhance the performance of wireless networks. In this paper, we consider the network randomness in the delay-tolerant UAV-assisted communication systems. We aim to optimize both the UAV trajectory and user association in an online manner to achieve a finite queueing delay at the users' buffers with the minimum energy consumption of the UAVs. We first formulate our problem as a stochastic dynamic programming problem that integrates the future expected energy consumption and delay into its objective function and constraints, respectively. To deal with the inaccurate knowledge of future user demand and mobility, we apply the Lyapunov optimization technique and convert it into a series of online joint UAV trajectory and user association optimization problems. However, each online problem is a non-convex non-linear integer programming problem, which is very challenging to solve in general. Especially, the user association states of all UAVs are coupled with each other due to the uplink interference. As such, we first eliminate the coupling relationship of user association variables in each online problem by using appropriate estimates of the interference. By exploiting the special graph structure of the problem, we can decompose the joint problem into inner optimization and outer optimization problems. Then, we propose the online UAV mobility and user association selection (UMUAS) scheme, which includes two steps to solve the inner and outer problems. In particular, the outer problem can be expressed as a maximum weight matching (MWM) problem, which can be solved optimally within a polynomial time. Simulation results show that our online UMUAS scheme achieves the near-optimal performance of the energy-delay tradeoff, which also has a $44.2\%$ improvement over the greedy scheme and a $51.3\%$ improvement over the interference-free scheme. Moreover, it achieves the highest energy efficiency among the three benchmark schemes.

12 February 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YWYi Wei
Yi Wei
TLTat-Ming Lok
Tat-Ming Lok
Interference alignment (IA) has been shown as an important technique to achieve a linear capacity scaling in wireless communications. However, the IA scheme over finite signaling dimensions for a general multiple-input-multiple-output (MIMO) X channel is still rarely studied. The main challenge of MIMO X channels is that the two sets of conditions for IA, namely the interference nulling conditions and the rank preservation conditions, get coupled. The usual IA methods for the interference channel and the broadcasting channel cannot be applied anymore. In this paper, we show that the rank preservation conditions can be replaced by a group of specific rank conditions, under which the IA problem is simplified. Then, based on this technique, an iterative algorithm of IA is designed for MIMO X channel. The algorithm is designed with limited signaling dimensions. From the simulation results, we find that the algorithm has good performances even under limited SNR.