Tien V. Thai

Dr. Tien V. Thai

The University of Danang - University of Science and Technology, Da Nang, Vietnam
orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
31 May 2025 in The University of Danang - Journal of Science and Technology
Verified
Journal Article
Open access
PDF file
Tien V. ThaiTien V. Thai
Tien V. Thai
MLMai T.P. Le
Mai T.P. Le
HNHieu V. Nguyen
Hieu V. Nguyen
THTung T. Huynh
Tung T. Huynh
Bài báo này nghiên cứu bài toán tối ưu hóa độ trễ trong mạng cell-free massive MIMO (CF-mMIMO) đa sóng mang tích hợp điện toán biên di động (MEC), ứng dụng kỹ thuật đa truy cập không trực giao (NOMA) để khai thác tương quan kênh truyền giữa các nhóm người dùng. Nhóm tác giả đề xuất thuật toán ghép cặp NOMA tham lam (Greedy-NOMA) dựa trên tương quan kênh, xác định cặp người dùng tối ưu nhằm nâng cao hiệu quả khử nhiễu liên tiếp trên nhiều kênh tần số. Mục tiêu là giảm thiểu độ trễ lớn nhất thông qua bài toán tối ưu phi tuyến, kết hợp phân bổ công suất đa kênh và tỷ lệ chuyển tải tính toán. Giải pháp gồm hai bước: (i) ghép cặp người dùng bằng Greedy-NOMA, và (ii) sử dụng phương pháp xấp xỉ lồi liên tiếp (SCA) để giải bài toán không lồi. Kết quả mô phỏng cho thấy, độ trễ giảm đáng kể, cải thiện đến 13,5% so với phương pháp NOMA ngẫu nhiên và CF-mMIMO thông thường, khẳng định tính khả thi cho mạng 5G/6G.

15 November 2025 in Ad Hoc Networks
Verified
Journal Article
Closed access
Tien V. ThaiTien V. Thai
Tien V. Thai
MLMai T. P. Le
Mai T. P. Le
HNHieu V. Nguyen
Hieu V. Nguyen
Oh-Soon ShinOh-Soon Shin
Oh-Soon Shin
MBMaria-Gabriella Di Benedetto
Maria-Gabriella Di Benedetto

1 January 2026 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Closed access
Tien V. ThaiTien V. Thai
Tien V. Thai
HNHieu Van Nguyen
Hieu Van Nguyen
CNCuong V. Nguyen
Cuong V. Nguyen
TQTran Quy-Huu
Tran Quy-Huu
MLMai T. P. Le
Mai T. P. Le

31 January 2025 in The University of Danang - Journal of Science and Technology
Verified
Journal Article
Open access
PDF file
TLTran Van Lic
Tran Van Lic
TPTran Dang Khoa Phan
Tran Dang Khoa Phan
THTran Thi Minh Hanh
Tran Thi Minh Hanh
VTVu Van Thanh
Vu Van Thanh
Tien V. ThaiTien V. Thai
Tien V. Thai
TKTran Anh Kiet
Tran Anh Kiet
This paper demonstrates that, using multiple data points around each gateway allows for the creation of accurate coverage heat maps by using a proposed LoRaWAN coverage estimation algorithm. This method effectively identifies areas with varying signal strength across Da Nang City, highlighting where additional gateways are needed to improve network reliability. Unlike previous studies, this research considers environmental factors such as topography and urban structures, enhancing prediction accuracy. This technique would be essential for optimizing essential for optimizing LPWAN deployments and ensuring efficient resource utilization. Future efforts will focus on refining neural network models and integrating real-time data to support scalable Smart City solutions and a more robust connectivity infrastructure, with this work planned for future research.


15 June 2026 in IEEE Access
Verified
Journal Article
Open access
HNHung Nguyen-Le
Hung Nguyen-Le
MVMinh Vu
Minh Vu
HNHieu Van Nguyen
Hieu Van Nguyen
MLMai T. P. Le
Mai T. P. Le
Tien V. ThaiTien V. Thai
Tien V. Thai
NTNghi H. Tran
Nghi H. Tran
This paper characterizes the capacity and capacity-achieving signaling of a non-coherent fading channel with 1-bit receiver quantization. The channel model features N specular components with random amplitudes and independent random phases, directly encompasses the fluctuating two-ray (FTR) model, widely adopted for mmWave and THz channels; it also includes the fixed-amplitude N-wave with diffuse power (NWDP) model as a special case. Unlike the single-specular case, marginalizing over multiple random amplitudes and phases results in transition probabilities that are analytically opaque, rendering the direct evaluation of optimality conditions mathematically intractable. To overcome this intractability, we develop a conditioning-and-lifting approach combined with convex optimization theory. This allows us to establish the structural properties of the optimal signaling strategy while avoiding the requirement for a tractable probability density function. Specifically, under a peak power constraint, we prove that on-off keying (OOK) is optimal. In addition, in the high power regime, the capacity converges to that of a Z-channel. Under an average power constraint, we further exploit properties of extreme points of convex sets and Dubins’s theorem to determine the number of mass points of the optimal inputs. In particular, we establish that the optimal magnitude distribution is bounded and discrete with at most three mass points, one of which is always at the origin, with numerical evidence consistently suggesting a two-point structure. Extensive results are finally provided to validate these findings and characterize the optimal quantization threshold design across various channel parameters.