Duc-Nghia Vu

Dr. Duc-Nghia Vu

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
Kieu-Trang PhamKieu-Trang Pham
Kieu-Trang Pham
DVDuc-Nghia Vu
Duc-Nghia Vu
PLPhuc Le
Phuc Le
CPChan Sik Park
Chan Sik Park
Temporary safety facilities (TSFs) are an essential support system providing necessary protection to workers during construction activities, which are targeted towards preventing the occurrence of incidents and accidents at the construction site; however, the schedule and location of installation and demolition of TSFs continue to rely on labor experience, and are often omitted from formal drawings or documents. This results in thousands of accidents in the construction industry, especially in construction small and medium-sized enterprises (SMEs) because of their several limiting factors; therefore, this study proposes automatic workspace planning for TSFs based on construction activities, which is a systematized approach for construction SMEs to practice occupational health and safety (OHS). By using building information modeling (BIM) and add-in algorithm, safety facilities can be simulated and visualized to integrate into the designated workspace. The developed system was implemented utilizing 4D-BIM for TSFs installation and validated with a case study on a residential building project. The result revealed that the visualized TSF produces a better understanding of safety measures with regard to project schedule. Additionally, TSFs workspace planning provides an affordable approach that motivates safety practices among the SMEs; consequently, the effectiveness of construction safety measures and their management is enhanced appreciably.

5 June 2017 in IEEE Access
Verified
Journal Article
Open access
NDNhu-Ngoc Dao
Nhu-Ngoc Dao
JLJunwook Lee
Junwook Lee
DVDuc-Nghia Vu
Duc-Nghia Vu
Jeongyeup PaekJeongyeup Paek
Jeongyeup Paek
Joongheon KimJoongheon Kim
Joongheon Kim
CKChangsup Keum
Changsup Keum
Serviceability is the ability of a network to serve user equipments (UEs) within desired requirements (e.g., throughput, delay, and packet loss). High serviceability is considered as one of the key foundational criteria toward a successful fog radio access infrastructure satisfying the Internet of Things paradigm in the 5G era. In this paper, we propose an adaptive resource balancing (ARB) scheme for serviceability maximization in fog radio access networks wherein the resource block (RB) utilization among remote radio heads (RRHs) are balanced using the backpressure algorithm with respect to a time-varying network topology issued by potential RRH mobilities. The optimal UE selection for service migration from a high-RB-utilization RRH to its neighboring low-RB-utilization RRHs is determined by the Hungarian method to minimize RB occupation after moving the service. Analytical results reveal that the proposed ARB scheme provides substantial gains compared with the standalone capacity-aware, max-rate, and cache-aware UE association approaches in terms of serviceability, availability, and throughput.

5 October 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
NDNhu-Ngoc Dao
Nhu-Ngoc Dao
DVDuc-Nghia Vu
Duc-Nghia Vu
WNWoongsoo Na
Woongsoo Na
Joongheon KimJoongheon Kim
Joongheon Kim
Sungrae ChoSungrae Cho
Sungrae Cho
The next generation mobile network anticipates integrated heterogeneous fronthaul and backhaul technologies referred to as a unified crosshaul architecture. The crosshaul enables a flexible and cost-efficient infrastructure for handling mobile data tsunami from dense Internet of things (IoT). However, stabilization, energy efficiency, and latency have not been jointly considered in the optimization of crosshaul performance. To overcome these issues, we propose an orchestration scheme referred to as the stabilized green crosshaul orchestration (SGCO). SGCO utilizes a Lyapunov-theory-based drift-plus-penalty policy to determine the optimal amount of offloaded data that should be processed either at the eastbound or westbound computing platforms to minimize energy consumption. To achieve system stability, the cache buffer is considered as the main constraint in developing the optimization process. Moreover, the amount of offloaded data transmitted via crosshaul links is selected by adopting the binary min-knapsack problem. Accordingly, a lightweight heuristic algorithm is proposed. As the cache buffer is stabilized and the computations are controlled, the SGCO ensures adjustable computing latency threshold for various IoT services. The performance analysis shows that the proposed SGCO scheme exposes effective energy consumption compared to other existing schemes while maintaining system stability considering latency.

4 April 2018 in Mobile Information Systems
Verified
Journal Article
Open access
PDF file
NDNhu-Ngoc Dao
Nhu-Ngoc Dao
DVDuc-Nghia Vu
Duc-Nghia Vu
YLYunseong Lee
Yunseong Lee
Sungrae ChoSungrae Cho
Sungrae Cho
CCChihyun Cho
Chihyun Cho
HKHyunbum Kim
Hyunbum Kim
In smart manufacturing, production machinery and auxiliary devices, referred to as industrial Internet of things (IIoT), are connected to a unified networking infrastructure for management and command deliveries in a precise production process. However, providing autonomous, reliable, and real-time offloaded services for such a production is an open challenge since these IIoT devices are assumed lightweight embedded platforms with limited computing performance. In this paper, we propose a pattern-identified online task scheduling (PIOTS) mechanism for the networking infrastructure, where multitier edge computing is provided, in order to handle the offloaded tasks in real time. First, historical IIoT task patterns in every timeslot are used to train a self-organizing map (SOM), which represents the features of the task patterns within defined dimensions. Consequently, offline task scheduling among edge computing-enabled entities is performed on the set of all SOM neurons using the Hungarian method to determine the expected optimal task assignments. In real-time context, whenever a task arrives at the infrastructure, the expected optimal assignment for the task is scheduled to the appropriate edge computing-enabled entity. Numerical simulation results show that the proposed PIOTS mechanism overcomes existing solutions in terms of computation performance and service capability.

16 August 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
WNWoongsoo Na
Woongsoo Na
YLYunseong Lee
Yunseong Lee
NDNhu-Ngoc Dao
Nhu-Ngoc Dao
DVDuc-Nghia Vu
Duc-Nghia Vu
AMArooj Masood
Arooj Masood
Sungrae ChoSungrae Cho
Sungrae Cho
Internet of Things (IoT) technology has accelerated various industries through digital transformation. In an edge computing-based smart factory, a significant number of IoT devices generate large volumes of real-time data. This big data requires efficient routing among Edge Gateways (EGs) and an Edge Server (ES) for real-time data processing. Existing industrial wireless communication systems provide relatively low data rates and network capacity for real-time sensor data and control information over a wireless channel. This calls for the use of the very large bandwidth available at the mmWave spectrum for real-time data transmission. Existing data routing techniques for the mmWave band are based on traditional mobile ad hoc routing techniques and do not reduce the transmission delay for real-time sensory data in smart manufacturing systems. Therefore, to alleviate the real-time data processing requirement, we propose a new directional routing and link scheduling algorithm based on Maximum Weight Independent Set (MWIS). The proposed algorithm solves complicated MWIS problems efficiently and computes backhaul link scheduling results in a relatively short time by lowering the deafness problem among EGs. For transmission fairness, we used a Jain’s fairness index method with numerical analysis of the transmission fairness constraint. We measured the efficiency of our proposed scheme in terms of throughput, delay, packet loss rate, and transmission fairness. Our simulation results show that the proposed scheme outperforms existing mmWave routing techniques. Moreover, we investigated the performance difference between the proposed algorithm and the optimal solution.

8 August 2018 in Transactions on Emerging Telecommunications Technologies
Verified
Journal Article
Closed access
PDF file
DVDuc-Nghia Vu
Duc-Nghia Vu
NDNhu-Ngoc Dao
Nhu-Ngoc Dao
YJYongwoon Jang
Yongwoon Jang
WNWoongsoo Na
Woongsoo Na
YKYoung‐Bin Kwon
Young‐Bin Kwon
Sungrae ChoSungrae Cho
Sungrae Cho