Nam Hoai Chu

Dr. Nam Hoai Chu


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
14 February 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
NCNam Hoai Chu
Nam Hoai Chu
Dinh Thai HoangDinh Thai Hoang
Dinh Thai Hoang
DNDiep Nguyen
Diep Nguyen
NHNguyen Van Huynh
Nguyen Van Huynh
EDEryk Dutkiewicz
Eryk Dutkiewicz
Unmanned aerial vehicle (UAV)-assisted data collection has been emerging as a prominent application due to its flexibility, mobility, and low operational cost. However, under the dynamic and uncertainty of IoT data collection and energy replenishment processes, optimizing the performance for UAV collectors is a very challenging task. Thus, this paper introduces a novel framework that jointly optimizes the flying speed and energy replenishment for each UAV to significantly improve the overall system performance (e.g., data collection and energy usage efficiency). Specifically, we first develop a Markov decision process to help the UAV automatically and dynamically make optimal decisions under the dynamics and uncertainties of the environment. Although traditional reinforcement learning algorithms such as Q-learning and deep Q-learning can help the UAV to obtain the optimal policy, they often take a long time to converge and require high computational complexity. Therefore, it is impractical to deploy these conventional methods on UAVs with limited computing capacity and energy resource. To that end, we develop advanced transfer learning techniques that allow UAVs to “share” and “transfer” learning knowledge, thereby reducing the learning time as well as significantly improving learning quality. Extensive simulations demonstrate that our proposed solution can improve the average data collection performance of the system up to 200% and reduce the convergence time up to 50% compared with those of conventional methods.

21 June 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
NCNam Hoai Chu
Nam Hoai Chu
Dinh Thai HoangDinh Thai Hoang
Dinh Thai Hoang
DNDiep Nguyen
Diep Nguyen
KPKhoa Phan
Khoa Phan
EDEryk Dutkiewicz
Eryk Dutkiewicz
TSTao Shu
Tao Shu
Creating and maintaining the Metaverse requires enormous resources that have never been seen before, especially computing resources for intensive data processing to support the Extended Reality, enormous storage resources, and massive networking resources for maintaining ultra high-speed and low-latency connections. Therefore, this work aims to propose a novel framework, namely MetaSlicing, that can provide a highly effective and comprehensive solution in managing and allocating different types of resources for Metaverse applications. In particular, by observing that Metaverse applications may have common functions, we first propose grouping applications into clusters, called MetaInstances. In a MetaInstance, common functions can be shared among applications. As such, the same resources can be used by multiple applications simultaneously, thereby enhancing resource utilization dramatically. To address the real-time characteristic and resource demand's dynamic and uncertainty in the Metaverse, we develop an effective framework based on the semi-Markov decision process and propose an intelligent admission control algorithm that can maximize resource utilization and enhance the Quality-of-Service for end-users. Extensive simulation results show that our proposed solution outperforms the Greedy-based policies by up to 80% and 47% in terms of long-term revenue for Metaverse providers and request acceptance probability, respectively.

26 April 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
NCNam Hoai Chu
Nam Hoai Chu
DNDiep Nguyen
Diep Nguyen
Dinh Thai HoangDinh Thai Hoang
Dinh Thai Hoang
Quoc-Viet PhamQuoc-Viet Pham
Quoc-Viet Pham
KPKhoa Phan
Khoa Phan
EDEryk Dutkiewicz
Eryk Dutkiewicz
Integrated Communications and Sensing (ICS) has recently emerged as an enabling technology for ubiquitous sensing and IoT applications. For ICS application to Autonomous Vehicles (AVs), optimizing the waveform structure is one of the most challenging tasks due to strong influences between sensing and data communication functions. Specifically, the preamble of a data communication frame is typically leveraged for the sensing function. As such, the higher number of preambles in a Coherent Processing Interval (CPI) is, the greater sensing task’s performance is. In contrast, communication efficiency is inversely proportional to the number of preambles. Moreover, surrounding radio environments are usually dynamic with high uncertainties due to their high mobility, making the ICS’s waveform optimization problem even more challenging. To that end, this paper develops a novel ICS framework established on the Markov decision process and recent advanced techniques in deep reinforcement learning. By doing so, without requiring complete knowledge of the surrounding environment in advance, the ICS-AV can adaptively optimize its waveform structure (i.e., number of frames in the CPI) to maximize sensing and data communication performance under the surrounding environment’s dynamic and uncertainty. Extensive simulations show that our proposed approach can improve the joint communication and sensing performance up to 46.26% compared with other baseline methods.

1 July 2019 in IEEE Access
Verified
Journal Article
Open access
TPTuan-Minh Pham
Tuan-Minh Pham
NCNam Hoai Chu
Nam Hoai Chu
Resource orchestration has a major impact on improving the performance of network services and reducing the system cost composed of both capital expenditures and operational expenses in Network Functions Virtualization (NFV). In this paper, we consider the optimal resource orchestration problem in a multi-domain NFV system under the competition among multiple NFV service providers (NSPs). In particular, we analyze a game on a NFV platform where a NSP can reserve different types of resources including the virtual computing, storage and network resources as well as the non-virtualized resources allocated by various NFV domains, for optimizing the utility in an individual manner. We also derive a necessary and sufficient condition for equilibrium under the competition among NSPs. We further investigate the equilibrium in a scenario of cooperation where NSPs build their own NFV infrastructure and join together to create a federation. Our numerical results illustrate the best response in resource reservation of a provider with respect to the strategy of other providers, and the effect of number of domains on the utility obtained by NSPs in the competition. Importantly, we demonstrate that a NSP is able to make a profit when the number of domains in a NFV infrastructure increases until a threshold, beyond which the utility of a NFV provider falls down, which is useful for designing a multi-domain NFV platform, especially in a multi-provider scenario. Another observation is that the best strategy of NSPs in the competition is opposite to that in the scenario of cooperation, which is significant for NSPs in the optimization of their utility.

28 July 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MUMd Ashraf Uddin
Md Ashraf Uddin
NCNam Hoai Chu
Nam Hoai Chu
RRReza Rafeh
Reza Rafeh
MBMutaz Barika
Mutaz Barika
Due to its nature of dynamic, mobility, and wireless data transfer, the Internet of Vehicles (IoV) is susceptible to a wide range of cyber threats, including spoofing, Distributed Denial of Service (DDoS) attacks, and malware. Intrusion Detection Systems (IDS) play a vital role in protecting the IoV ecosystem by continuously monitoring network traffic to detect and respond to intrusions, malicious activities, and policy violations in real time. However, most existing research has focused on centralized, machine learning-based IDS solutions for IoV, often overlooking its inherently distributed architecture. Due to their high computational demands, these centralized systems often depend on Cloud resources to detect cyber threats, which can lead to increased response delays. On the other hand, Edge nodes typically lack the necessary resources to train and deploy complex machine learning and deep learning algorithms. To address this issue, this paper proposes an effective hierarchical classification framework designed for IoV networks. Hierarchical classification enables classifiers to be trained and deployed across multiple levels. This allows Edge nodes to independently identify specific types of attacks. With this approach, Edge nodes can conduct targeted attack detection while utilizing Cloud nodes for more comprehensive threat analysis and coordination. Considering the resource limitations of Edge nodes, we employ the Boruta feature selection method to reduce data dimensionality and enhance processing efficiency. To evaluate our proposed framework, we utilize the latest IoV security dataset CIC-IoV2024 and CIC-DDoS2019 datasets, achieving promising results that demonstrate the feasibility and effectiveness of our models in securing IoV networks. This hierarchical framework might improve the scalability and responsiveness of intrusion detection in distributed IoV environments. By offloading lightweight detection tasks to Edge nodes and reserving deeper analysis for the Cloud, the model can reduce latency and network load, making real-time threat response more feasible. The proposed approach can offer a practical solution for deploying effective, resource-aware cybersecurity mechanisms in real-world vehicular networks, where traditional centralized systems fall short.

29 May 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TVThai T. Vu
Thai T. Vu
NCNam Hoai Chu
Nam Hoai Chu
KPKhoa Phan
Khoa Phan
Dinh Thai HoangDinh Thai Hoang
Dinh Thai Hoang
DNDiep Nguyen
Diep Nguyen
EDEryk Dutkiewicz
Eryk Dutkiewicz
By executing offloaded tasks from mobile users, edge computing augments mobile devices with computing/communications resources from edge nodes (ENs), thus enabling new services/applications (e.g., real-time gaming, virtual/augmented reality). However, despite being more resourceful than mobile devices, allocating ENs’ computing/communications resources to a given favorable set of users (e.g., closer to edge nodes) may block other devices from their services. This is often the case for most existing task offloading and resource allocation approaches that only aim to maximize the network social welfare or minimize the total energy consumption but do not consider the computing/battery status of each mobile device. This work develops an energy-based proportionally fair task offloading and resource allocation framework for a multi-layer cooperative edge computing network to serve all user equipments (UEs) while considering both their service requirements and individual energy/battery levels. The resulting optimization involves both binary (offloading decisions) and continuous (resource allocation) variables. To tackle the NP-hard mixed integer optimization problem, we leverage the fact that the relaxed problem is convex and propose a distributed algorithm, namely the dynamic branch-and-bound Benders decomposition (DBBD). DBBD decomposes the original problem into a master problem (MP) for the offloading decisions and multiple subproblems (SPs) for resource allocation. To quickly eliminate inefficient offloading solutions, the MP is integrated with powerful Benders cuts exploiting the ENs’ resource constraints. We then develop a dynamic branch-and-bound algorithm (DBB) to efficiently solve the MP considering the load balance among ENs. The SPs can either be solved for their closed-form solutions or be solved in parallel at ENs, thus reducing the complexity. The numerical results show that the DBBD returns the optimal solution in maximizing the proportional fairness among UEs. The DBBD has higher fairness indexes, i.e., Jain's index and min-max ratio, in comparison with the existing ones that minimize the total consumed energy.