Thinh Quang Dinh
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
Thinh Quang Dinh has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Tony Q. S. Quek
Singapore University of Technology and Design
3 shared publications - Diep N. Nguyen
School of Electrical and Data Engineering, University of Technology Sydney, Ultimo, NSW, Australia
2 shared publications - Dinh Thai Hoang
University of Technology Sydney
2 shared publications - Eva Lagunas
Interdisciplinary Centre for Security, Reliability, and Trust (SnT), University of Luxembourg, Luxembourg City, Luxembourg
2 shared publications - Hyundong Shin
Kyung Hee University
2 shared publications - Ben Liang
University of Toronto
1 shared publication
Latest Publications
- 16 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (4) , 3771-3784
Quantum Annealing for Complex Optimization in Satellite Communication Systems
Satellite communication (SatCom) systems play a vital role in providing global connectivity and enable a wide range of applications, including Internet of Things (IoT) connectivity for remote areas, such as forests and oceans. Two crucial resource allocation challenges in SatCom are beam placement (BP) and frequency assignment (FA) problems, which involve the clique covering (CC) and graph coloring (GC) problems, respectively. Conventional solutions for these problems incur excessive computational cost, which is intractable for classical computers. A promising approach is to formulate these problems using the Ising model, construct their Hamiltonians, and then solve them efficiently by a quantum computer. However, the current quantum computers have very limited hardware and can only handle rather small inputs. To overcome this limitation, we propose a hybrid-quantum-classical-computational pipeline where an efficient hamiltonian reduction method is the key for solving large CC/GC instances. Through experiments on real quantum computers, our reduction method outperforms commercial solutions, allowing quantum annealers to handle significantly larger BP/FA instances while maintaining high probability to achieve feasible solutions and near-optimal performance. Although the inherent hardness of the CC/GC problems cannot be overcome by quantum computing, our research contributes to the early exploration of quantum computing in the context of the complex optimization problems in SatCom systems, particularly in the realm of IoT connectivity for remote areas.
- 16 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (4) , 3771-3784
Quantum Annealing for Complex Optimization in Satellite Communication Systems
Satellite communication (SatCom) systems play a vital role in providing global connectivity and enable a wide range of applications, including Internet of Things (IoT) connectivity for remote areas, such as forests and oceans. Two crucial resource allocation challenges in SatCom are beam placement (BP) and frequency assignment (FA) problems, which involve the clique covering (CC) and graph coloring (GC) problems, respectively. Conventional solutions for these problems incur excessive computational cost, which is intractable for classical computers. A promising approach is to formulate these problems using the Ising model, construct their Hamiltonians, and then solve them efficiently by a quantum computer. However, the current quantum computers have very limited hardware and can only handle rather small inputs. To overcome this limitation, we propose a hybrid-quantum-classical-computational pipeline where an efficient hamiltonian reduction method is the key for solving large CC/GC instances. Through experiments on real quantum computers, our reduction method outperforms commercial solutions, allowing quantum annealers to handle significantly larger BP/FA instances while maintaining high probability to achieve feasible solutions and near-optimal performance. Although the inherent hardness of the CC/GC problems cannot be overcome by quantum computing, our research contributes to the early exploration of quantum computing in the context of the complex optimization problems in SatCom systems, particularly in the realm of IoT connectivity for remote areas.
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 11 (2) , 1210-1224
Semantic Image Encoding and Communication for Earth Observation With LEO Satellites
The substantial volume of data generated by Earth observation (EO) satellites poses a significant challenge to the limited-rate satellite-to-ground links. This paper addresses the downlink communication problem of change detection in multi-spectral satellite images for EO purposes. The proposed method is based on a cohesive strategy capable of eliminating clouds and performing semantic encoding during image processing. This approach is a manifestation of semantic communication, as it encodes vital information for the target application, in the form of changed multi-spectral pixels (MPs) to minimize energy consumption. The proposed method is based on a three-stage end-to-end scoring mechanism, which quantifies the significance of each MP before determining its transmission. Specifically, the sensing image is (1) normalized and passed through a high-performance cloud filtering via the Cloud-SLR model, (2) passed to the proposed scoring algorithm that uses Change-Net to identify MPs that have a high likelihood of being changed, compress them, and forward to the ground station, and (3) reconstructed at ground gateway based on the reference image and received data. The numerical results show the effectiveness of the proposed framework in achieving energy savings of up to 58% while upholding the transmission of high-quality data for satellite-based EO applications.
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 11 (2) , 1210-1224
Semantic Image Encoding and Communication for Earth Observation With LEO Satellites
The substantial volume of data generated by Earth observation (EO) satellites poses a significant challenge to the limited-rate satellite-to-ground links. This paper addresses the downlink communication problem of change detection in multi-spectral satellite images for EO purposes. The proposed method is based on a cohesive strategy capable of eliminating clouds and performing semantic encoding during image processing. This approach is a manifestation of semantic communication, as it encodes vital information for the target application, in the form of changed multi-spectral pixels (MPs) to minimize energy consumption. The proposed method is based on a three-stage end-to-end scoring mechanism, which quantifies the significance of each MP before determining its transmission. Specifically, the sensing image is (1) normalized and passed through a high-performance cloud filtering via the Cloud-SLR model, (2) passed to the proposed scoring algorithm that uses Change-Net to identify MPs that have a high likelihood of being changed, compress them, and forward to the ground station, and (3) reconstructed at ground gateway based on the reference image and received data. The numerical results show the effectiveness of the proposed framework in achieving energy savings of up to 58% while upholding the transmission of high-quality data for satellite-based EO applications.
- 15 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 22 (10) , 5918-5932
In-Network Computation for Large-Scale Federated Learning Over Wireless Edge Networks
Most conventional Federated Learning (FL) models are using a star network topology where all users aggregate their local models at a single server (e.g., a cloud server). That causes significant overhead in terms of both communications and computing at the server, delaying the training process, especially for large scale FL systems with straggling nodes. This article proposes a novel edge network architecture that enables decentralizing the model aggregation process at the server, thereby significantly reducing the training delay for the whole FL network. Specifically, we design a highly-effective in-network computation framework (INC) consisting of a user scheduling mechanism, an in-network aggregation process (INA) which is designed for both primal- and primal-dual methods in distributed machine learning problems, and a network routing algorithm with theoretical performance bounds. The in-network aggregation process, which is implemented at edge nodes and cloud node, can adapt two typical methods to allow edge networks to effectively solve the distributed machine learning problems. Under the proposed INA, we then formulate a joint routing and resource optimization problem, aiming to minimize the aggregation latency. The problem turns out to be NP-hard, and thus we propose a polynomial time routing algorithm which can achieve near optimal performance with a theoretical bound. Simulation results showed that the proposed algorithm can achieve more than 99$\%$ of the optimal solution and reduce the FL training latency, up to 5.6 times w.r.t other baselines. The proposed INC framework can not only help reduce the FL training latency but also significantly decrease cloud's traffic and computing overhead. By embedding the computing/aggregation tasks at the edge nodes and leveraging the multi-layer edge-network architecture, the INC framework can liberate FL from the star topology to enable large-scale FL.- 15 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 22 (10) , 5918-5932
In-Network Computation for Large-Scale Federated Learning Over Wireless Edge Networks
Most conventional Federated Learning (FL) models are using a star network topology where all users aggregate their local models at a single server (e.g., a cloud server). That causes significant overhead in terms of both communications and computing at the server, delaying the training process, especially for large scale FL systems with straggling nodes. This article proposes a novel edge network architecture that enables decentralizing the model aggregation process at the server, thereby significantly reducing the training delay for the whole FL network. Specifically, we design a highly-effective in-network computation framework (INC) consisting of a user scheduling mechanism, an in-network aggregation process (INA) which is designed for both primal- and primal-dual methods in distributed machine learning problems, and a network routing algorithm with theoretical performance bounds. The in-network aggregation process, which is implemented at edge nodes and cloud node, can adapt two typical methods to allow edge networks to effectively solve the distributed machine learning problems. Under the proposed INA, we then formulate a joint routing and resource optimization problem, aiming to minimize the aggregation latency. The problem turns out to be NP-hard, and thus we propose a polynomial time routing algorithm which can achieve near optimal performance with a theoretical bound. Simulation results showed that the proposed algorithm can achieve more than 99$\%$ of the optimal solution and reduce the FL training latency, up to 5.6 times w.r.t other baselines. The proposed INC framework can not only help reduce the FL training latency but also significantly decrease cloud's traffic and computing overhead. By embedding the computing/aggregation tasks at the edge nodes and leveraging the multi-layer edge-network architecture, the INC framework can liberate FL from the star topology to enable large-scale FL.- 17 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (7) , 4282-4295
A Hybrid DQN and Optimization Approach for Strategy and Resource Allocation in MEC Networks
We consider a multi-user multi-server mobile edge computing (MEC) network with time-varying fading channels and formulate an offloading decision and resource allocation problem. To solve this mixed-integer non-convex problem, we propose two hybrid approaches that learn offloading strategy with DQN (opt-DQN) or Q-table (opt-QL) at each user equipment (UE). The communication resources are allocated with an optimization algorithm at each computational access point (CAP). We also propose a pure DQN method that learns both the offloading strategy and resource allocation via Q-learning (QL). We analyze the convergence behavior of the QL-based algorithms from a game-theoretical perspective and demonstrate the performance of the proposed hybrid approaches for different network sizes. The simulation results show that the hybrid approaches reach lower costs than other baseline algorithms and the pure-DQN approach. Moreover, the performance of the pure-DQN approach degrades severely as the network size increases, while opt-DQN still performs the best, followed by opt-QL. These observations demonstrate that the hybrid approach that combines the advantages of both QL and convex optimization is a promising design for a multi-user MEC network, wherein complicated offloading and resource allocation strategies need to be determined in a timely and accurate fashion.
- 17 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (7) , 4282-4295
A Hybrid DQN and Optimization Approach for Strategy and Resource Allocation in MEC Networks
We consider a multi-user multi-server mobile edge computing (MEC) network with time-varying fading channels and formulate an offloading decision and resource allocation problem. To solve this mixed-integer non-convex problem, we propose two hybrid approaches that learn offloading strategy with DQN (opt-DQN) or Q-table (opt-QL) at each user equipment (UE). The communication resources are allocated with an optimization algorithm at each computational access point (CAP). We also propose a pure DQN method that learns both the offloading strategy and resource allocation via Q-learning (QL). We analyze the convergence behavior of the QL-based algorithms from a game-theoretical perspective and demonstrate the performance of the proposed hybrid approaches for different network sizes. The simulation results show that the hybrid approaches reach lower costs than other baseline algorithms and the pure-DQN approach. Moreover, the performance of the pure-DQN approach degrades severely as the network size increases, while opt-DQN still performs the best, followed by opt-QL. These observations demonstrate that the hybrid approach that combines the advantages of both QL and convex optimization is a promising design for a multi-user MEC network, wherein complicated offloading and resource allocation strategies need to be determined in a timely and accurate fashion.
- 6 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 19 (3) , 2137-2149
Online Resource Procurement and Allocation in a Hybrid Edge-Cloud Computing System
By acquiring cloud-like capacities at the edge of a network, edge computing is expected to significantly improve user experience. In this paper, we formulate a hybrid edge-cloud computing system where an edge device with limited local resources can rent more from a cloud node and perform resource allocation to serve its users. The resource procurement and allocation decisions depend not only on the cloud’s multiple rental options but also on the edge’s local processing cost and capacity. We first propose an offline algorithm whose decisions are made with full information of future demand. Then, an online algorithm is proposed where the edge node makes irrevocable decisions in each timeslot without future information of demand. We show that both algorithms have constant performance bounds from the offline optimum. Numerical results acquired with Google cluster-usage traces indicate that the cost of the edge node can be substantially reduced by using the proposed algorithms, up to 80% in comparison with baseline algorithms. We also observe how the cloud’s pricing structure and edge’s local cost influence the procurement decisions.
- 6 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 19 (3) , 2137-2149
Online Resource Procurement and Allocation in a Hybrid Edge-Cloud Computing System
By acquiring cloud-like capacities at the edge of a network, edge computing is expected to significantly improve user experience. In this paper, we formulate a hybrid edge-cloud computing system where an edge device with limited local resources can rent more from a cloud node and perform resource allocation to serve its users. The resource procurement and allocation decisions depend not only on the cloud’s multiple rental options but also on the edge’s local processing cost and capacity. We first propose an offline algorithm whose decisions are made with full information of future demand. Then, an online algorithm is proposed where the edge node makes irrevocable decisions in each timeslot without future information of demand. We show that both algorithms have constant performance bounds from the offline optimum. Numerical results acquired with Google cluster-usage traces indicate that the cost of the edge node can be substantially reduced by using the proposed algorithms, up to 80% in comparison with baseline algorithms. We also observe how the cloud’s pricing structure and edge’s local cost influence the procurement decisions.
- 22 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (12) , 6353-6367
Learning for Computation Offloading in Mobile Edge Computing
Mobile edge computing (MEC) is expected to provide cloud-like capacities for mobile users (MUs) at the edge of wireless networks. However, deploying MEC systems faces many challenges, one of which is to achieve an efficient distributed offloading mechanism for multiple users in time-varying wireless environments. In this paper, we study a multi-user multi-edge-node computation offloading problem. Since edge nodes' communication and computing capacities are limited which leads resource contention when many MUs offload to the same edge node at the same time, we formulate this problem as a non-cooperative exact potential game (EPG), where each MU, in each time slot, selfishly maximizes its number of processed central processor unit (CPU) cycles and reduces its energy consumption. Assuming that channel information is static and available to MUs, we show that MUs could achieve a Nash equilibrium via a best response-based offloading mechanism. Next, we extend the problem to a practical scenario, where the number of processed CPU cycles is time-varying and unknown to MUs because of the uncertain channel information. In this case, we adopt an unknown payoff game framework and prove that the EPG properties still hold. Then, we propose a model-free reinforcement learning offloading mechanism which helps MUs learn their long-term offloading strategies to maximize their long-term utilities. Numerical results illustrate that our proposed algorithm for unknown CSI outperforms other schemes, such as local processing and random assignment, and achieves up to 87.87% average long-term payoffs compared to the perfect CSI case.
- 22 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (12) , 6353-6367
Learning for Computation Offloading in Mobile Edge Computing
Mobile edge computing (MEC) is expected to provide cloud-like capacities for mobile users (MUs) at the edge of wireless networks. However, deploying MEC systems faces many challenges, one of which is to achieve an efficient distributed offloading mechanism for multiple users in time-varying wireless environments. In this paper, we study a multi-user multi-edge-node computation offloading problem. Since edge nodes' communication and computing capacities are limited which leads resource contention when many MUs offload to the same edge node at the same time, we formulate this problem as a non-cooperative exact potential game (EPG), where each MU, in each time slot, selfishly maximizes its number of processed central processor unit (CPU) cycles and reduces its energy consumption. Assuming that channel information is static and available to MUs, we show that MUs could achieve a Nash equilibrium via a best response-based offloading mechanism. Next, we extend the problem to a practical scenario, where the number of processed CPU cycles is time-varying and unknown to MUs because of the uncertain channel information. In this case, we adopt an unknown payoff game framework and prove that the EPG properties still hold. Then, we propose a model-free reinforcement learning offloading mechanism which helps MUs learn their long-term offloading strategies to maximize their long-term utilities. Numerical results illustrate that our proposed algorithm for unknown CSI outperforms other schemes, such as local processing and random assignment, and achieves up to 87.87% average long-term payoffs compared to the perfect CSI case.
- Top Cited Papers
- 28 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 65 (00906778) , 1
Offloading in Mobile Edge Computing: Task Allocation and Computational Frequency Scaling
In this paper, we propose an optimization framework of offloading from a single mobile device (MD) to multiple edge devices. We aim to minimize both total tasks' execution latency and the MD's energy consumption by jointly optimizing the task allocation decision and the MD's central process unit (CPU) frequency. This paper considers two cases for the MD, i.e., fixed CPU frequency and elastic CPU frequency. Since these problems are NP-hard, we propose a linear relaxation-based approach and a semidefinite relaxation (SDR)-based approach for the fixed CPU frequency case, and an exhaustive search-based approach and an SDR-based approach for the elastic CPU frequency case. Our simulation results show that the SDR-based algorithms achieve near optimal performance. Performance improvement can be obtained with the proposed scheme in terms of energy consumption and tasks' execution latency when multiple edge devices and elastic CPU frequency are considered. Finally, we show that the MD's flexible CPU range can have an impact on the task allocation.
- 28 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 65 (00906778) , 1
Top Cited PapersOffloading in Mobile Edge Computing: Task Allocation and Computational Frequency Scaling
In this paper, we propose an optimization framework of offloading from a single mobile device (MD) to multiple edge devices. We aim to minimize both total tasks' execution latency and the MD's energy consumption by jointly optimizing the task allocation decision and the MD's central process unit (CPU) frequency. This paper considers two cases for the MD, i.e., fixed CPU frequency and elastic CPU frequency. Since these problems are NP-hard, we propose a linear relaxation-based approach and a semidefinite relaxation (SDR)-based approach for the fixed CPU frequency case, and an exhaustive search-based approach and an SDR-based approach for the elastic CPU frequency case. Our simulation results show that the SDR-based algorithms achieve near optimal performance. Performance improvement can be obtained with the proposed scheme in terms of energy consumption and tasks' execution latency when multiple edge devices and elastic CPU frequency are considered. Finally, we show that the MD's flexible CPU range can have an impact on the task allocation.