Nguyen Thi Thanh Van

Nguyen Thi Thanh Van

Auto-generated profile, based on publicly available information

Nguyen Thi Thanh Van

Faculty of Electrical and Electronic Engineering, Phenikaa University, Hanoi, Vietnam

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
19 October 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
NVNguyen Thi Thanh Van
Nguyen Thi Thanh Van
Nguyen Cong LuongNguyen Cong Luong
Nguyen Cong Luong
HNHuy T. Nguyen
Huy T. Nguyen
SHAOHAN FENGSHAOHAN FENG
SHAOHAN FENG
DNDusit Niyato
Dusit Niyato
DKDong In Kim
Dong In Kim
Federated Learning (FL) as a promising technique is able to address the privacy issues in machine learning. However, due to the broadcast nature of wireless channel, one of the key challenges of FL is its vulnerability to wireless security threats. Thus, in this paper, we consider the model update security in FL. In particular, we propose to adopt a covert communication technique with which a friendly jammer transmits jamming signals to prevent a warden from detecting local model update transmissions of mobile devices in FL. The use of jamming signals reduces the transmission rate of the devices. Thus, we formulate an optimization problem that jointly determines the jamming power, local model transmission power, and local training accuracy to minimize the FL latency, given a security performance requirement. The problem is non-convex, and we propose an alternating descent algorithm to solve it. Extensive simulations are conducted and the results demonstrate the effectiveness and network performance improvement of the proposed algorithm.

13 April 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Nguyen Cong LuongNguyen Cong Luong
Nguyen Cong Luong
TNThi Thanh Van Nguyen
Thi Thanh Van Nguyen
SHAOHAN FENGSHAOHAN FENG
SHAOHAN FENG
HNHuy T. Nguyen
Huy T. Nguyen
TNTao Dusit Niyato
Tao Dusit Niyato
DKDong In Kim
Dong In Kim
In this article, we investigate the dynamic network service provider (SP) and service selection in a user-centric network. Here, the network services are different combinations of network resources. In particular, we consider an intelligent reflecting surface (IRS)-assisted wireless network in which mobile users select different network resources, i.e., transmit power and IRS resources, provided by different SPs. To analyze the SP and service selection of the users, we propose to use an evolutionary game. In the game, the users (players) adjust their selections of the SPs and services based on their utilities. We model the SP and service adaptation of the users by the replicator dynamics and analyze the equilibrium of the evolutionary game. Extensive simulations are provided to demonstrate the consistency and effectiveness of the proposed game approach.

28 September 2021 in IEEE Communications Letters
Verified
Journal Article
Closed access
NTNguyen Van Tam
Nguyen Van Tam
NHNguyen Quang Hieu
Nguyen Quang Hieu
NVNguyen Thi Thanh Van
Nguyen Thi Thanh Van
Nguyen Cong LuongNguyen Cong Luong
Nguyen Cong Luong
DNDusit Niyato
Dusit Niyato
DKDong In Kim
Dong In Kim
In this letter, we consider a Coded Edge Computing (CEC) network in which a client encodes its computation subtasks using the Maximum Distance Separable (MDS) code before offloading them to helpers. The CEC network is heterogeneous in which the helpers are different in computing capacity, wireless communication stability, and computing price. Thus, the client needs to determine a desirable size of MDS-coded subtasks and selects proper helpers such that the computation latency is within the deadline and the incentive cost is minimal. This problem is challenging since the helpers are generally dynamic and random in the computing, communication, and computing price. We thus propose to adopt a Deep Reinforcement Learning (DRL) algorithm that allows the client to learn and find optimal decisions without any prior knowledge of network environments. The experiment results reveal that the proposed algorithm outperforms the standard Q-learning and baseline algorithms in both terms of computation latency and incentive cost.

30 January 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
NVNguyen Thi Thanh Van
Nguyen Thi Thanh Van
Nguyen Cong LuongNguyen Cong Luong
Nguyen Cong Luong
SFShaohan Feng
Shaohan Feng
VNVan Ca Nguyen
Van Ca Nguyen
DKDong In Kim
Dong In Kim
In this paper, we address a dynamic network resource selection problem for mobile users in a rate-splitting multiple access (RSMA)-enabled network by leveraging evolutionary games. Particularly, mobile users are able to locally and dynamically make their selection on orthogonal resource blocks (RBs), which are also considered as network resources (NRs), over time to achieve their desired utilities. Then, RSMA is used for each group of users selecting the same NR. With the use of RSMA, the main goal is to optimize the beamformers of the common and private messages for users in the same group to maximize their sum rate. The resulting problem is generally non-convex, and thus we develop a successive convex approximation (SCA)-based algorithm to efficiently solve it in an iterative fashion. To model the NR adaptation of users, we propose to use two evolutionary games, i.e . a traditional evolutionary game (TEG) and fractional evolutionary game (FEG). The FEG approach enables users to incorporate memory effects ( i.e . their past experiences) for their decision-making, which is more realistic than the TEG approach. We then theoretically verify the existence of the equilibrium of the proposed game approaches. Simulation results are provided to validate their consistency with the theoretical analysis and merits of the proposed approaches. They also reveal that, compared with TEG, FEG enables users to leverage past information for their decision-making, resulting in less communication overhead, while still guaranteeing convergence.

16 June 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
NVNguyen Thi Thanh Van
Nguyen Thi Thanh Van
HNHuy T. Nguyen
Huy T. Nguyen
Nguyen Cong LuongNguyen Cong Luong
Nguyen Cong Luong
TMTien Ngo Manh
Tien Ngo Manh
DNDusit Niyato
Dusit Niyato
DKDong In Kim
Dong In Kim
In this paper, we consider an integrated data and energy network and D2D communication coexistence (DED2D) system. The DED2D system allows a base station (BS) to transfer data to information-demanded users (IUs) and energy to energy-demanded users (EUs), i.e., using a time-fraction-based information and energy transfer (TFIET) scheme. Furthermore, the DED2D system enables D2D communications to share spectrum with the BS. Therefore, the DED2D system addresses the growth of energy and spectrum demands of the next generation networks. However, the interference caused by the D2D communications and propagation loss of wireless links can significantly degrade the data throughput of IUs. To deal with the issues, we propose to deploy an intelligent reflecting surface (IRS) in the DED2D system. Then, we formulate an optimization problem that aims to optimize the information beamformer for the IUs, energy beamformer for EUs, time fractions of the TFIET, transmit power of D2D transmitters, and reflection coefficients of the IRS to maximize IUs’ worse throughput while satisfying the harvested energy requirement of EUs and D2D rate threshold. The max-min throughput optimization problem is computationally intractable, and we develop an alternating descent algorithm to resolve it with low computational complexity. The simulation results demonstrate the effectiveness of the proposed algorithm.

26 January 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
NVNguyen Thi Thanh Van
Nguyen Thi Thanh Van
Nguyen Cong LuongNguyen Cong Luong
Nguyen Cong Luong
SHAOHAN FENGSHAOHAN FENG
SHAOHAN FENG
HNHuy T. Nguyen
Huy T. Nguyen
Kun ZhuKun Zhu
Kun Zhu
DNDusit Niyato
Dusit Niyato
In this paper, we address dynamic network selection problems of mobile users in an Intelligent Reflecting Surface (IRS)-enabled wireless network. In particular, the users dynamically select different Service Providers (SPs) and network services over time. The network services are composed of adjustable resources of IRS and transmit power. To formulate the SP and network service selection, we adopt an evolutionary game in which the users are able to adapt their network selections depending on the utilities that they achieve. For this, the replicator dynamics is used to model the service selection adaptation of the users. To allow the users to take their past service experiences into account their decisions, we further adopt an enhanced version of the evolutionary game, namely fractional evolutionary game, to study the SP and network service selection. The fractional evolutionary game incorporates the memory effect that captures the users’ memory on their decisions. We theoretically prove that both the game approaches have a unique equilibrium. Finally, we provide numerical results to demonstrate the effectiveness of our proposed game approaches. In particular, we have reveal some important finding, for instance, with the memory effect, the users can achieve the utility higher than that without the memory effect.