Mai T. P. Le

dblp:373/9755 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
5since 2021 · last 2026
0000-0001-9657-5172ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 8 · 3 first-author · 5 since 2021
YearPublicationVenuePosition
2026 Next-generation MIMO empowered mobile edge computing: A comprehensive survey toward 6G systems
Tien V. Thai, Mai T. P. Le, Hieu Van Nguyen, Oh-Soon Shin, Maria-Gabriella Di Benedetto
Ad Hoc Networks2
2026 Deep learning-driven joint beamforming and phase shift optimization for secrecy communication of IRS-aided SWIPT systems
Vien Nguyen-Duy-Nhat, Mai T. P. Le, Hieu Van Nguyen, Pham Viet Tuan
Comput. Networks2
2025 AI-Empowered Green Mobile Edge Computing: A Novel Framework of Spiking Neural Network Application
Hieu V. Nguyen, Thanh V. Vu, Phu X. Nguyen 0001, Mai T. P. Le, Hai-Au Huynh, Hung Nguyen-Tan
Mob. Networks Appl.4
2024 QoE-Aware Power Allocation for Aerial-Relay Massive MIMO Networks
abstract
This paper proposes a power allocation framework based on the per-user quality-of-experience (QoE) conditions for an aerial relay massive MIMO (mMIMO) network, assuming the direct transmission between the mMIMO base station and ground users (UEs) is unavailable. We first derive closed-form spectral efficiency expressions for the mMIMO-based system, with a UAV acting as the aerial relay. Then, we formulate a joint optimization problem of power allocation and QoE in the downlink, aiming to maximize the sum throughput of the serving ground UEs. The problem is generally hard to solve due to the non-convex constraints and non-concave objective function. To address it, we propose a two-step algorithm based on inner convex approximation (ICA) method. However, the ICA-based algorithm requires an initial feasible point, which is difficult to find by generating a random point as commonly conceived in existing approaches while satisfying the QoE constraints. To tackle this issue, we develop a max-min problem, whose solution leads to an initial feasible point that maximizes the difference between the per-user rate and its corresponding QoE threshold. Numerical results are used to demonstrate the validity of the theoretical analysis and the effectiveness of the proposed algorithms.
Mai T. P. Le, Hieu Van Nguyen, Vien Nguyen-Duy-Nhat, Luca Sanguinetti
IEEE Trans. Netw. Serv. Manag.1
2023 Robust 3D Beamforming for Secure UAV Communications by DAE
Cuong Pham-Quoc, Vien Nguyen-Duy-Nhat, Mai T. P. Le, Hung Nguyen-Le, Chien Tang-Tan, Tuan Tang-Anh, Nghia Nguyen-Xuan
Mob. Networks Appl.3
2019 What is the Benefit of Code-domain NOMA in Massive MIMO?
abstract
In overloaded Massive MIMO systems, wherein the number K of user equipments (UEs) exceeds the number of base station antennas M, it has recently been shown that non-orthogonal multiple access (NOMA) can increase performance. This paper aims at identifying cases of the classical operating regime K <; M, where code-domain NOMA can also improve the spectral efficiency of Massive MIMO. Particular attention is given to use cases in which poor favorable propagation conditions are experienced. Numerical results show that Massive MIMO with planar antenna arrays can benefit from NOMA in practical scenarios where the UEs are spatially close to each other.
Mai T. P. Le, Luca Sanguinetti, Emil Björnson, Maria-Gabriella Di Benedetto
PIMRC1
2018 On information-theoretic limits of code-domain NOMA for 5G
abstract
Motivated by recent theoretical challenges for 5G, this study aims to position relevant results in the literature on code‐domain non‐orthogonal multiple access (NOMA) from an information‐theoretic perspective, given that most of the recent intuition of NOMA relies on another domain, that is, the power domain. Theoretical derivations for several code‐domain NOMA schemes are reported and interpreted, adopting a unified framework that focuses on the analysis of the NOMA spreading matrix, in terms of load, sparsity, and regularity features. The comparative analysis shows that it is beneficial to adopt extreme low‐dense code‐domain NOMA in the large system limit, where the number of resource elements and number of users grow unboundedly while their ratio, called load, is kept constant. Particularly, when optimum receivers are used, the adoption of a regular low‐dense spreading matrix is beneficial to the system achievable rates, which are higher than those obtained with either irregular low‐dense or dense formats, for any value of load. For linear receivers, which are more favourable in practice due to lower complexity, the regular low‐dense NOMA still has better performance in the underloaded regime (load ), while the irregular counterpart outperforms all the other schemes in the overloaded scenario (load ).
Mai T. P. Le, Guido Carlo Ferrante, Giuseppe Caso, Luca De Nardis, Maria-Gabriella Di Benedetto
IET Commun.1
2018 Fundamental Limits of Low-Density Spreading NOMA With Fading
abstract
Spectral efficiency of low-density spreading non-orthogonal multiple access channels in the presence of fading is derived for linear detection with independent decoding and optimum decoding. The large system limit, where both the number of users and number of signal dimensions grow with fixed ratio, called load, is considered. In the case of optimum decoding, it is found that low-density spreading underperforms dense spreading for all loads. Conversely, linear detection is characterized by different behaviors in the underloaded versus overloaded regimes. In particular, it is shown that spectral efficiency changes smoothly as load increases. However, in the overloaded regime, the spectral efficiency of low-density spreading is higher than that of dense spreading.
Mai T. P. Le, Guido Carlo Ferrante, Tony Q. S. Quek, Maria-Gabriella Di Benedetto
IEEE Trans. Wirel. Commun.1
2017 Performance Evaluation of Non-prefiltering vs. Time Reversal Prefiltering in Distributed and Uncoordinated IR-UWB Ad-Hoc Networks
Giuseppe Caso, Luca De Nardis, Mai T. P. Le, Flavio Maschietti, Jocelyn Fiorina, Maria-Gabriella Di Benedetto
Mob. Networks Appl.3