Thang Xuan Vu

Thang Xuan Vu

Auto-generated profile, based on publicly available information

Thang Xuan Vu

Interdisciplinary Center for Security, Reliability and Trust, University of Luxembourg, Esch-sur-Alzette, Luxembourg

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 October 2020 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Open access
OKOltjon Kodheli
Oltjon Kodheli
Eva LagunasEva Lagunas
Eva Lagunas
NMNicola Maturo
Nicola Maturo
SSShree Krishna Sharma
Shree Krishna Sharma
BSBhavani Shankar
Bhavani Shankar
GGGeorge Goussetis
George Goussetis
Satellite communications (SatComs) have recently entered a period of renewed interest motivated by technological advances and nurtured through private investment and ventures. The present survey aims at capturing the state of the art in SatComs, while highlighting the most promising open research topics. Firstly, the main innovation drivers are motivated, such as new constellation types, on-board processing capabilities, non-terrestrial networks and space-based data collection/processing. Secondly, the most promising applications are described i.e. 5G integration, space communications, Earth observation, aeronautical and maritime tracking and communication. Subsequently, an in-depth literature review is provided across five axes: i) system aspects, ii) air interface, iii) medium access, iv) networking, v) testbeds & prototyping. Finally, a number of future challenges and the respective open research topics are described.

25 August 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
HTHieu Tran
Hieu Tran
VNVan Ca Nguyen
Van Ca Nguyen
SCSymeon Chatzinotas
Symeon Chatzinotas
TVThang X. Vu
Thang X. Vu
BOBjörn Ottersten
Björn Ottersten
Unmanned aerial vehicle (UAV) communication has emerged as a prominent technology for emergency communications (e.g., natural disaster) in the Internet of Things (IoT) networks to enhance the ability of disaster prediction, damage assessment, and rescue operations promptly. A UAV can be deployed as a flying base station (BS) to collect data from time-constrained IoT devices and then transfer it to a ground gateway (GW). In general, the latency constraint at IoT devices and UAV’s limited storage capacity highly hinder practical applications of UAV-assisted IoT networks. In this paper, full-duplex (FD) radio is adopted at the UAV to overcome these challenges. In addition, half-duplex (HD) scheme for UAV-based relaying is also considered to provide a comparative study between two modes (viz., FD and HD). Herein, a device is considered to be successfully served if its data is collected by the UAV and conveyed to GW timely during flight time. In this context, we aim to maximize the number of served IoT devices by jointly optimizing bandwidth, power allocation, and the UAV trajectory while satisfying each device’s requirement and the UAV’s limited storage capacity. The formulated optimization problem is troublesome to solve due to its non-convexity and combinatorial nature. Towards appealing applications, we first relax binary variables into continuous ones and transform the original problem into a more computationally tractable form. By leveraging inner approximation framework, we derive newly approximated functions for non-convex parts and then develop a simple yet efficient iterative algorithm for its solutions. Next, we attempt to maximize the total throughput subject to the number of served IoT devices. Finally, numerical results show that the proposed algorithms significantly outperform benchmark approaches in terms of the number of served IoT devices and system throughput.

8 September 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Open access
VNVan Ca Nguyen
Van Ca Nguyen
SSShree Krishna Sharma
Shree Krishna Sharma
TVThang X. Vu
Thang X. Vu
SCSymeon Chatzinotas
Symeon Chatzinotas
BOBjorn Ottersten
Bjorn Ottersten
Federated learning (FL) allows multiple edge computing nodes to jointly build a shared learning model without having to transfer their raw data to a centralized server, thus reducing communication overhead. However, FL still faces a number of challenges such as non-iid distributed data and heterogeneity of user equipments (UEs). Enabling a large number of UEs to join the training process in every round raises a potential issue of the heavy global communication burden. To address these issues, we generalize the current state-of-the-art Federated Averaging (FedAvg) by adding a weight-based proximal term to the local loss function. The proposed FL algorithm runs stochastic gradient descent in parallel on a sampled subset of the total UEs with replacement during each global round. We provide a convergence upper bound characterizing the trade-off between convergence rate and global rounds, showing that a small number of active UEs per round still guarantees convergence. Next, we employ the proposed FL algorithm in wireless Internet-of-Things (IoT) networks to minimize either total energy consumption or completion time of FL, where a simple yet efficient path-following algorithm is developed for its solutions. Finally, numerical results on unbalanced datasets are provided to demonstrate the performance improvement and robustness on the convergence rate of the proposed FL algorithm over FedAvg. They also reveal that the proposed algorithm requires much less training time and energy consumption than the FL algorithm with full user participation. These observations advocate the proposed FL algorithm for a paradigm shift in bandwidth-constrained learning wireless IoT networks.

15 March 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
FKFatemeh Kavehmadavani
Fatemeh Kavehmadavani
VNVan Ca Nguyen
Van Ca Nguyen
TVThang X. Vu
Thang X. Vu
SCSymeon Chatzinotas
Symeon Chatzinotas
Open radio access network (ORAN) Alliance offers a disaggregated RAN functionality built using open interface specifications between blocks. To efficiently support various competing services, namely enhanced mobile broadband (eMBB) and ultra-reliable and low-latency (uRLLC), the ORAN Alliance has introduced a standard approach toward more virtualized, open, and intelligent networks. To realize the benefits of ORAN in optimizing resource utilization, this paper studies an intelligent traffic steering (TS) scheme within the proposed disaggregated ORAN architecture. For this purpose, we propose a joint intelligent traffic prediction, flow-split distribution, dynamic user association, and radio resource management (JIFDR) framework in the presence of unknown dynamic traffic demands. To adapt to dynamic environments on different time scales, we decompose the formulated optimization problem into two long-term and short-term subproblems, where the optimality of the latter is strongly dependent on the optimal dynamic traffic demand. We then apply a long-short-term memory (LSTM) model to effectively solve the long-term subproblem, aiming to predict dynamic traffic demands, RAN slicing, and flow-split decisions. The resulting non-convex short-term subproblem is converted to a more computationally tractable form by exploiting successive convex approximations. Finally, simulation results are provided to demonstrate the effectiveness of the proposed algorithms compared to several well-known benchmark schemes.

20 August 2020 in IEEE Access
Verified
Journal Article
Open access
CNCong T. Nguyen
Cong T. Nguyen
YSYuris Mulya Saputra
Yuris Mulya Saputra
NHNguyen Van Huynh
Nguyen Van Huynh
NNNgoc-Tan Nguyen
Ngoc-Tan Nguyen
TKTran Viet Khoa
Tran Viet Khoa
BOBjoörn Ottersten
Bjoörn Ottersten
Social distancing plays a pivotal role in preventing the spread of viral diseases illnesses such as COVID-19. By minimizing the close physical contact among people, we can reduce the chances of catching the virus and spreading it across the community. This two-part paper aims to provide a comprehensive survey on how emerging technologies, e.g., wireless and networking, artificial intelligence (AI) can enable, encourage, and even enforce social distancing practice. In this Part I, we provide a comprehensive background of social distancing including basic concepts, measurements, models, and propose various practical social distancing scenarios.We then discuss enabling wireless technologies which are especially effective and can be widely adopted in practice to keep distance, encourage, and enforce social distancing in general. These technologies open many new solutions and directions to deal with problems in social distancing, e.g., symptom prediction, detection and monitoring quarantined people, and contact tracing. The companion paper Part II [1] surveys other emerging and related technologies, such as machine learning, computer vision, thermal, ultrasound, etc., and discusses open issues and challenges (e.g., privacypreserving, scheduling, and incentive mechanisms) in implementing social distancing in practice.

10 June 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Open access
HTHieu Tran
Hieu Tran
TVThang Xuan Vu
Thang Xuan Vu
SCSymeon Chatzinotas
Symeon Chatzinotas
SSShahram ShahbazPanahi
Shahram ShahbazPanahi
BOBjörn Ottersten
Björn Ottersten
In this paper, we design the UAV trajectory to minimize the total energy consumption while satisfying the requested timeout (RT) requirement and energy budget, which is accomplished via jointly optimizing the path and UAV's velocities along subsequent hops. The corresponding optimization problem is difficult to solve due to its non-convexity and combinatorial nature. To overcome this difficulty, we solve the original problem via two consecutive steps. Firstly, we propose two algorithms, namely heuristic search, and dynamic programming (DP) to obtain a feasible set of paths without violating the GU's RT requirements based on the traveling salesman problem with time window (TSPTW). Then, they are compared with exhaustive search and traveling salesman problem (TSP) used as reference methods. While the exhaustive algorithm achieves the best performance at a high computation cost, the heuristic algorithm exhibits poorer performance with low complexity. As a result, the DP is proposed as a practical trade-off between the exhaustive and heuristic algorithms. Specifically, the DP algorithm results in near-optimal performance at a much lower complexity. Secondly, for given feasible paths, we propose an energy minimization problem via a joint optimization of the UAV's velocities along subsequent hops. Finally, numerical results are presented to demonstrate the effectiveness of our proposed algorithms. The results show that the DP-based algorithm approaches the exhaustive search's performance with a significantly reduced complexity. It is also shown that the proposed solutions outperform the state-of-theart benchmarks in terms of both energy consumption and outage performance.