Trung Kien Vu
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
Trung Kien Vu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Matti Latva-Aho
Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
4 shared publicationsMehdi Bennis
Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
4 shared publicationsMerouane Debbah
Large Networks and System Group (LANEAS), Centrale Supélec, Université Paris-Saclay, 91192 Gif-sur-Yvette, France, and also with the Mathematical and Algorithmic Sciences Laboratory, Huawei France R&D, 92100 Paris, France
4 shared publications- Sungoh Kwon
Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan, South Korea
2 shared publications Chen-Feng Liu
Centre for Wireless Communications, University of Oulu, Oulu, Finland
1 shared publicationChoong Seon Hong
Department of Computer Engineering, Kyung Hee University, Yongin, South Korea
1 shared publication
Latest Publications
- 18 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 18 (4) , 2431-2445
Joint Path Selection and Rate Allocation Framework for 5G Self-Backhauled mm-wave Networks
Owing to severe path loss and unreliable transmission over a long distance at higher frequency bands, this paper investigates the problem of path selection and rate allocation for multi-hop self-backhaul millimeter wave (mmWave) networks. Enabling multi-hop mmWave transmissions raises a potential issue of increased latency, and thus, this work aims at addressing the fundamental questions: “how to select the best multi-hop paths and how to allocate rates over these paths subject to latency constraints?”. In this regard, a new system design, which exploits multiple antenna diversity, mmWave bandwidth, and traffic splitting techniques, is proposed to improve the downlink transmission. The studied problem is cast as a network utility maximization, subject to an upper delay bound constraint, network stability and network dynamics. By leveraging stochastic optimization, the problem is decoupled into: (i) path selection and (ii) rate allocation sub-problems, whereby a framework which selects the best paths is proposed using reinforcement learning techniques. Moreover, the rate allocation is a nonconvex program, which is converted into a convex one by using the successive convex approximation method. Via mathematical analysis, a comprehensive performance analysis and convergence proof are provided for the proposed solution. Numerical results show that the proposed approach ensures reliable communication with a guaranteed probability of up to 99:9999%, and reduces latency by 50:64% and 92:9% as compared to baseline models. Furthermore, the results showcase the key trade-off between latency and network arrival rate.
- 18 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 18 (4) , 2431-2445
Joint Path Selection and Rate Allocation Framework for 5G Self-Backhauled mm-wave Networks
Owing to severe path loss and unreliable transmission over a long distance at higher frequency bands, this paper investigates the problem of path selection and rate allocation for multi-hop self-backhaul millimeter wave (mmWave) networks. Enabling multi-hop mmWave transmissions raises a potential issue of increased latency, and thus, this work aims at addressing the fundamental questions: “how to select the best multi-hop paths and how to allocate rates over these paths subject to latency constraints?”. In this regard, a new system design, which exploits multiple antenna diversity, mmWave bandwidth, and traffic splitting techniques, is proposed to improve the downlink transmission. The studied problem is cast as a network utility maximization, subject to an upper delay bound constraint, network stability and network dynamics. By leveraging stochastic optimization, the problem is decoupled into: (i) path selection and (ii) rate allocation sub-problems, whereby a framework which selects the best paths is proposed using reinforcement learning techniques. Moreover, the rate allocation is a nonconvex program, which is converted into a convex one by using the successive convex approximation method. Via mathematical analysis, a comprehensive performance analysis and convergence proof are provided for the proposed solution. Numerical results show that the proposed approach ensures reliable communication with a guaranteed probability of up to 99:9999%, and reduces latency by 50:64% and 92:9% as compared to baseline models. Furthermore, the results showcase the key trade-off between latency and network arrival rate.
- 6 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (4) , 708-711
Ultra-Reliable Communication in 5G mmWave Networks: A Risk-Sensitive Approach
In this letter, we investigate the problem of providing gigabit wireless access with reliable communication in 5G millimeter-Wave (mmWave) massive multiple-input multipleoutput (MIMO) networks. In contrast to the classical network design based on average metrics, we propose a distributed risk-sensitive reinforcement learning-based framework to jointly optimize the beamwidth and transmit power, while taking into account the sensitivity of mmWave links due to blockage. Numerical results show that our proposed algorithm achieves more than 9 Gbps of user throughput with a guaranteed probability of 90%, whereas the baselines guarantee less than 7.5 Gbps. More importantly, there exists a rate-reliability-network density tradeoff, in which as the user density increases from 16 to 96 per km2, the fraction of users that achieve 4 Gbps are reduced by 11.61% and 39.11% in the proposed and the baseline models, respectively.
- 6 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (4) , 708-711
Ultra-Reliable Communication in 5G mmWave Networks: A Risk-Sensitive Approach
In this letter, we investigate the problem of providing gigabit wireless access with reliable communication in 5G millimeter-Wave (mmWave) massive multiple-input multipleoutput (MIMO) networks. In contrast to the classical network design based on average metrics, we propose a distributed risk-sensitive reinforcement learning-based framework to jointly optimize the beamwidth and transmit power, while taking into account the sensitivity of mmWave links due to blockage. Numerical results show that our proposed algorithm achieves more than 9 Gbps of user throughput with a guaranteed probability of 90%, whereas the baselines guarantee less than 7.5 Gbps. More importantly, there exists a rate-reliability-network density tradeoff, in which as the user density increases from 16 to 96 per km2, the fraction of users that achieve 4 Gbps are reduced by 11.61% and 39.11% in the proposed and the baseline models, respectively.
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (9) , 6032-6046
Joint Load Balancing and Interference Mitigation in 5G Heterogeneous Networks
We study the problem of joint load balancing and interference mitigation in heterogeneous networks in which massive multiple-input multiple-output macro cell base station (BS) equipped with a large number of antennas, overlaid with wireless self-backhauled small cells (SCs), is assumed. Self-backhauled SC BSs with full-duplex communication employing regular antenna arrays serve both macro users and SC users by using the wireless backhaul from macro BS in the same frequency band. We formulate the joint load balancing and interference mitigation problem as a network utility maximization subject to wireless backhaul constraints. Subsequently, leveraging the framework of stochastic optimization, the problem is decoupled into dynamic scheduling of macro cell users, backhaul provisioning of SCs, and offloading macro cell users to SCs as a function of interference and backhaul links. Via numerical results, we show the performance gains of our proposed framework under the impact of SCs density, number of BS antennas, and transmit power levels at low and high frequency bands. It is shown that our proposed approach achieves a 5.6 times gain in terms of cell-edge performance as compared with the closed-access baseline in ultra-dense networks with 350 SC BSs per km 2 .
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (9) , 6032-6046
Joint Load Balancing and Interference Mitigation in 5G Heterogeneous Networks
We study the problem of joint load balancing and interference mitigation in heterogeneous networks in which massive multiple-input multiple-output macro cell base station (BS) equipped with a large number of antennas, overlaid with wireless self-backhauled small cells (SCs), is assumed. Self-backhauled SC BSs with full-duplex communication employing regular antenna arrays serve both macro users and SC users by using the wireless backhaul from macro BS in the same frequency band. We formulate the joint load balancing and interference mitigation problem as a network utility maximization subject to wireless backhaul constraints. Subsequently, leveraging the framework of stochastic optimization, the problem is decoupled into dynamic scheduling of macro cell users, backhaul provisioning of SCs, and offloading macro cell users to SCs as a function of interference and backhaul links. Via numerical results, we show the performance gains of our proposed framework under the impact of SCs density, number of BS antennas, and transmit power levels at low and high frequency bands. It is shown that our proposed approach achieves a 5.6 times gain in terms of cell-edge performance as compared with the closed-access baseline in ultra-dense networks with 350 SC BSs per km 2 .
- 17 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (9) , 2041-2044
Ultra-Reliable and Low Latency Communication in mmWave-Enabled Massive MIMO Networks
Ultra-reliability and low latency are two key components in 5G networks. In this letter, we investigate the problem of ultra-reliable and low-latency communication in millimeter wave-enabled massive multiple-input multiple-output networks. The problem is cast as a network utility maximization subject to probabilistic latency and reliability constraints. To solve this problem, we resort to the Lyapunov technique, whereby a utility-delay control approach is proposed, which adapts to channel variations and queue dynamics. Numerical results demonstrate that our proposed approach ensures reliable communication with a guaranteed probability of 99.99%, and reduces latency by 28.41% and 77.11% as compared to baselines with and without probabilistic latency constraints, respectively.
- 17 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (9) , 2041-2044
Ultra-Reliable and Low Latency Communication in mmWave-Enabled Massive MIMO Networks
Ultra-reliability and low latency are two key components in 5G networks. In this letter, we investigate the problem of ultra-reliable and low-latency communication in millimeter wave-enabled massive multiple-input multiple-output networks. The problem is cast as a network utility maximization subject to probabilistic latency and reliability constraints. To solve this problem, we resort to the Lyapunov technique, whereby a utility-delay control approach is proposed, which adapts to channel variations and queue dynamics. Numerical results demonstrate that our proposed approach ensures reliable communication with a guaranteed probability of 99.99%, and reduces latency by 28.41% and 77.11% as compared to baselines with and without probabilistic latency constraints, respectively.
- 1 January 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E98.B (11) , 2238-2247
Cooperative Interference Mitigation Algorithm in Heterogeneous Networks
- 1 January 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E98.B (11) , 2238-2247
Cooperative Interference Mitigation Algorithm in Heterogeneous Networks
- Open Access
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-11
Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors
We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-11
Open AccessMobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors
We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.