NVNguyen Thi Thanh Van

Nguyen Thi Thanh Van

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nguyen Thi Thanh Van has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Network Access Selection for URLLC and eMBB Applications in Sub-6 GHz-mmWave-THz Networks: Game Theory Versus Multi-Agent Reinforcement Learning

    by Nguyen Thi Thanh Van, Nguyen Le Tuan, Nguyen Cong Luong, Tien Hoa Nguyen, Shaohan Feng, Shimin Gong, Dusit Niyato, Dong In Kim

    We investigate a heterogeneous network (HetNet) including sub-6GHz base stations (BSs), mmWave BSs, and THz BSs to support enhanced mobile broadband (eMBB) users and ultra-reliable low-latency communication (URLLC) users. We particularly investigate a user-centric network in which the users locally and dynamically select and switch among BSs over time to achieve their highest utility. Two types of users have different Quality of Service (QoS) requirements. Thus, we design two types of utility functions specifically for the eMBB users and URLLC users. Then, to model the dynamic selection behavior of the users, we propose to use a fractional game with the power-law memory. The fractional game allows the eMBB users and the URLLC users to incorporate their past strategies into their current selection, thus improving their utility. Furthermore, we consider the case that the BSs communicate the system state with each other, and we model the network selection of the users as a multi-agent problem. Then, we propose to use a multi-agent deep reinforcement learning (MADRL) algorithm that enables the URLLC users and eMBB users to make their network selection decision online to achieve their long-term utility. Various simulation results are provided to demonstrate the scalability and effectiveness of the proposed approaches. Particularly, compared with the classical game, the fractional game is able to achieve a higher utility but incurs a higher network adaptation cost. Moreover, the different types of URLLC users (in terms of latency and reliability requirements) and the number of URLLC users in the network significantly affect the total utility and the network selection strategies of the eMBB users. Importantly, given the full observations, the MADRL outperforms both classical and fractional games in terms of total network utility.


  • SWIPT-Enabled MISO Ad Hoc Network Underlay RSMA-Based System With IRS

    by Nguyen Thi Thanh Van, Nguyen Cong Luong, Shaohan Feng, Shimin Gong, Dusit Niyato, Dong In Kim

    In this paper, we propose a simultaneous wireless information and power transfer (SWIPT)-enabled ad hoc network underlay rate-splitting multiple access (RSMA)-based system with intelligent reflecting surface (IRS). Therein, a base station (BS) in a primary network uses RSMA to serve primary users (PUs), and secondary user (SU) pairs constitute an ad hoc network sharing the spectrum with the primary network. Both power splitting (PS)- and time splitting (TS)-based SWIPT protocols are used in the ad hoc network that allow the SU receivers to decode the information and harvest energy simultaneously. An IRS is deployed to further enhance the system performance. We formulate optimization problems that optimize the common data rate allocation and beamformers associated with the common and private messages of RSMA, the beamformers and the PS/TS factors in the ad hoc network, and reflection coefficients of the IRS to maximize the minimum rate of the PUs while satisfying the requirements of harvested energy and data rate of the SU pairs. The optimization problems are non-convex and challenging to be solved. We propose low complexity algorithms based on alternating descent techniques. Numerical results demonstrate the effectiveness and improvement of the proposed algorithms, especially when combined with the TS-based SWIPT.


  • Open Access

    Energy Consumption Minimization for Autonomous Mobile Robot: A Convex Approximation Approach

    by Nguyen Thi Thanh Van, Ngo Manh Tien, Nguyen Cong Luong, Ha Thi Kim Duyen

    In this paper, we consider a trajectory design problem of an autonomous mobile robot working in industrial environments. In particular, we formulate an optimization problem that jointly determines the trajectory of the robot and the time step duration to minimize the energy consumption without obstacle collisions. We consider both static and moving obstacles scenarios. The optimization problems are nonconvex, and the main contribution of this work proposing successive convex approximation (SCA) algorithms to solve the nonconvex problems with the presence of both static and moving obstacles. In particular, we first consider the optimization problem in the scenario with static obstacles and then consider the optimization problem in the scenario with static and moving obstacles. Then, we propose two SCA algorithms to solve the nonconvex optimization problems in both the scenarios. Simulation results clearly show that the proposed algorithms outperform the A* algorithm, in terms of energy consumption. This shows the effectiveness of the proposed algorithms.


  • Evolutionary Games for Dynamic Network Resource Selection in RSMA-Enabled 6G Networks

    by Nguyen Thi Thanh Van, Nguyen Cong Luong, Shaohan Feng, Van-Dinh Nguyen, 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.


  • Open Access

    JOINT POWER COST AND LATENCY MINIMIZATION FOR SECURE COLLABORATIVE LEARNING SYSTEM

    by Nguyen Thi Thanh Van, Vu Van Quang, Nguyen Cong Luong

    This work investigates the model update security in a collaborative learning or federated learning network by using the covert communication. The CC uses the jamming signal and multiple friendly jammers (FJs) are deployed that can offer jamming services to the model owner, i.e., a base station (BS). To enable the BS to select the best FJ, i.e., the lowest cost FJ, a truthful auction is adopted. Then, a problem is formulated to optimize the jamming power, transmission power, and local accuracy. The objective is to minimize the training latency, subject to the security performance requirement and budget of the BS. To solve the non-convex problem, we adopt a Successive Convex Approximation algorithm. The simulation results reveals some interesting things. For example, the trustful auction reduces the jamming cost of the BS as the number of FJs increases.

  • Intelligence Reflecting Surface-Aided Integrated Data and Energy Networking Coexisting D2D Communications

    by Nguyen Thi Thanh Van, Huy T. Nguyen, Nguyen Cong Luong, Tien Ngo Manh, Dusit Niyato, 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.


  • Dynamic Network Service Selection in Intelligent Reflecting Surface-Enabled Wireless Systems: Game Theory Approaches

    by Nguyen Thi Thanh Van, Nguyen Cong Luong, Shaohan Feng, Huy T. Nguyen, Kun Zhu, Thien Van Luong, 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.


  • Open Access

    Đánh giá các chiến lược dạy kỹ năng đọc tiếng Anh chuyên ngành cho sinh viên năm thứ ba ngành Điện tại Trường Đại học Công nghiệp Hà Nội

    by Đỗ Thị Huyền, Nguyễn Thị Thanh Bằng, Nguyễn Thị Vân

    Nghiên cứu này nhằm đánh giá các kỹ thuật giảng dạy kỹ năng đọc hiểu tiếng Anh chuyên ngành cho sinh viên năm thứ 3 Khoa Điện và đưa ra những khuyến nghị nhằm nâng cao chất lượng giảng dạy tiếng Anh chuyên ngành tại Trường Đại học Công nghiệp Hà Nội (ĐHCNHN). Đối tượng nghiên cứu gồm 95 sinh viên năm thứ 3 Khoa Điện và 4 giảng viên tiếng Anh chuyên ngành của ĐHCNHN. Dữ liệu nghiên cứu được thu thập và phân tích dựa trên bảng câu hỏi khảo sát dành cho sinh viên và giảng viên. Nghiên cứu đã mô tả các kỹ thuật dạy đọc hiểu tiếng Anh chuyên ngành, phân tích những điểm mạnh và hạn chế của các kỹ thuật đó. Trên cơ sở này, tác giả đã đưa ra một số gợi ý nhằm nâng cao chất lượng giảng dạy kỹ năng đọc hiểu tiếng Anh chuyên ngành tại ĐHCNHN.  The study aims to evaluate the strategies for teaching ESP for third-year Electrical Engineering majored students and offers recommendations to enhance the teaching quality of ESP reading at Hanoi University of Industry (HaUI). The participants of this study consist of 95 third-year students at Faculty of Electrical Engineering and 4 ESP lecturers at HaUI. The data were collected and analysed from two sets of survey questionnaires (for students and for lecturers). The results of the study identify strategies adopted to teach ESP reading, their benefits and limitations. Thence, the researcher gives some suggestions to improve the quality of teaching ESP reading at HaUI. 

  • Latency Minimization in Covert Communication-Enabled Federated Learning Network

    by Nguyen Thi Thanh Van, Nguyen Cong Luong, Huy T. Nguyen, Feng Shaohan, Dusit Niyato, 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.


  • Adaptive Task Offloading in Coded Edge Computing: A Deep Reinforcement Learning Approach

    by Nguyen Van Tam, Nguyen Quang Hieu, Nguyen Thi Thanh Van, Nguyen Cong Luong, Dusit Niyato, 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.