Vu Nguyen Ha

Vu Nguyen Ha

Auto-generated profile, based on publicly available information

Vu Nguyen Ha

Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
18 October 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
LCLin Chen
Lin Chen
VHVu Nguyen Ha
Vu Nguyen Ha
Eva LagunasEva Lagunas
Eva Lagunas
LWLinlong Wu
Linlong Wu
SCSymeon Chatzinotas
Symeon Chatzinotas
BOBjörn Ottersten
Björn Ottersten
Beam Hopping (BH) is a popular technique considered for next-generation multi-beam satellite communication system which allows a satellite focusing its resources on where they are needed by selectively illuminating beams. While beam illumination plan can be adjusted according to its needs, the main limitation of convectional BH is the adjacent beam avoidance requirement needed to maintain acceptable levels of interference. With the recent maturity of precoding technique, a natural way forward is to consider a dynamic beam illumination scheme with selective precoding, where large areas with high-demand can be covered by multiple active precoded beams. In this paper, we mathematically model such beam illumination design problem employing an interference-based penalty function whose goal is to avoid precoding whenever possible subject to beam demand satisfaction constraints. The problem can be written as a binary quadratic programming (BQP). Next, two convexification frameworks are considered namely: (i) A Semi-Definition Programming (SDP) approach particularly targeting BQP type of problems, and (ii) Multiplier Penalty and Majorization-Minimization (MPMM) based method which guarantees to converge to a local optimum. Finally, a greedy algorithm is proposed to alleviate complexity with minimal impact on the final performance. Supporting results based on numerical simulations show that the proposed schemes outperform the relevant benchmarks in terms of demand matching performance while minimizing the use of precoding.

13 February 2025 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
GFGianluca Fontanesi
Gianluca Fontanesi
Flor OrtizFlor Ortiz
Flor Ortiz
Eva LagunasEva Lagunas
Eva Lagunas
Luis Manuel Garcés-SocarrásLuis Manuel Garcés-Socarrás
Luis Manuel Garcés-Socarrás
Victor Monzon BaezaVictor Monzon Baeza
Victor Monzon Baeza
SCSymeon Chatzinotas
Symeon Chatzinotas
This paper provides a comprehensive survey on the application and development of Artificial Intelligence (AI) and Machine Learning (ML) in satellite communication (SATCOM). It explores the increasing integration of AI/ML technologies in SATCOM systems, highlighting their potential to enhance performance, efficiency, and adaptability in response to growing demands for connectivity and data processing. The survey categorizes various use cases across different layers of satellite networks, detailing conventional solutions and the advantages of employing AI/ML techniques. It discusses the challenges associated with onboard processing, including hardware constraints, radiation tolerance, and the need for efficient resource management. Furthermore, the document examines the role of neuromorphic computing and COTS (Commercial Off-The-Shelf) devices in facilitating AI applications in space environments. Finally, we discuss the long-term developments of AI in the SATCOM sector and potential research directions. Overall, the survey emphasizes the transformative impact of AI/ML on the future of SATCOM, paving the way for innovative solutions in next-generation satellite networks.

4 October 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
TNTi Ti Nguyen
Ti Ti Nguyen
VHVu Nguyen Ha
Vu Nguyen Ha
LLLong Bao Le
Long Bao Le
RSRobert Schober
Robert Schober
Data compression (DC) has the potential to significantly improve the computation offloading performance in hierarchical fog-cloud systems. However, it remains unknown how to optimally determine the compression ratio jointly with the computation offloading decisions and the resource allocation. This optimization problem is studied in this paper where we aim to minimize the maximum weighted energy and service delay cost (WEDC) of all users. First, we consider a scenario where DC is performed only at the mobile users. We prove that the optimal offloading decisions have a threshold structure. Moreover, a novel three-step approach employing convexification techniques is developed to optimize the compression ratios and the resource allocation. Then, we address the more general design where DC is performed at both the mobile users and the fog server. We propose three algorithms to overcome the strong coupling between the offloading decisions and the resource allocation. Numerical results show that the proposed optimal algorithm for DC at only the mobile users can reduce the WEDC by up to 65% compared to computation offloading strategies that do not leverage DC or use sub-optimal optimization approaches. The proposed algorithms with additional DC at the fog server lead to a further reduction of the WEDC.

3 July 2023 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
DTDuc-Dung Tran
Duc-Dung Tran
SSShree Krishna Sharma
Shree Krishna Sharma
VHVu Nguyen Ha
Vu Nguyen Ha
SCSymeon Chatzinotas
Symeon Chatzinotas
IWIsaac Woungang
Isaac Woungang
Grant-free non-orthogonal multiple access (GF-NOMA) has emerged as a promising access technology for the fifth generation and beyond wireless networks that enable ultra-reliable and low-latency communications (URLLC) to ensure low access latency and high connectivity density. Furthermore, designing energy-efficient (EE) resource allocation strategies is a crucial aspect of future cellular system development. Taking these goals into account, this paper proposes an EE sub-channel and power allocation strategy for URLLC-enabled GF-NOMA (URLLC-GF-NOMA) systems based on multi-agent (MA) deep reinforcement learning (MADRL). In particular, the URLLC-GF-NOMA methods using MA dueling double deep Q network (MA3DQN), MA double deep Q network (MA2DQN), and MA deep Q network (MADQN) techniques are designed to enable users to select the most appropriate sub-channel and transmission power for their communications. The aim is to build an efficient MADRL-based solution, ensuring rapid convergence with small signaling overhead, to maximize the network EE while fulfilling the URLLC requirements of all users. Simulation results show that the MADQN and MA2DQN methods, which have lower complexity than MA3DQN, are more appropriate for the URLLC-GF-NOMA systems under consideration. Moreover, our proposed methods exhibit superior convergence characteristics, a reduction in signaling overhead, and enhanced EE performance compared to other benchmark strategies.

8 November 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
TNTi Ti Nguyen
Ti Ti Nguyen
VHVu Nguyen Ha
Vu Nguyen Ha
LLLong Bao Le
Long Bao Le

23 August 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
KNKha-Hung Nguyen
Kha-Hung Nguyen
VHVu Nguyen Ha
Vu Nguyen Ha
Eva LagunasEva Lagunas
Eva Lagunas
SCSymeon Chatzinotas
Symeon Chatzinotas
JGJoel Grotz
Joel Grotz
This paper investigates the uplink transmission of an integrated satellite-terrestrial network, wherein the low-earth-orbit (LEO) satellites provide backhaul services to isolated cellular base stations (BSs) for forwarding mobile user (UE) data to the core network. In this integrated system, the high mobility of LEO satellites (LEOSats) introduces significant challenges in managing radio resource allocation (RA), as well as the associations between UEs, BSs, and LEOSats for supporting users’ demands efficiently, while also dynamically balancing the capacity of UE-BS access and BS-LEO backhaul links. Regarding these critical issues, the paper aims to jointly optimize the two-tier UE-BS and BS-LEOSat association, sub-channel assignment, bandwidth allocation, and power control to meet users’ demands in the shortest transmission time. This optimization problem, however, falls into the category of mixed-integer non-convex programming, making it very challenging and requiring advanced solution techniques to find optimal solutions. To tackle this complex problem efficiently, we first develop an iterative centralized algorithm by utilizing convex approximation and compressed-sensing-based methods to deal with binary variables. Furthermore, for practical implementation and to offload computation from the central processing node, we propose a Dec - Alg that can be implemented in parallel at local controllers and achieve efficient solutions. Numerical results are also illustrated to strengthen the effectiveness of our proposed algorithms compared to traditional greedy and benchmark algorithms.