Dat Van Anh Duong

Dr. Dat Van Anh Duong

University of Ulsan, Ulsan, Republic of Korea
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
6 March 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SAShathee Akter
Shathee Akter
Dat Van Anh DuongDat Van Anh Duong
Dat Van Anh Duong
SYSeokhoon Yoon
Seokhoon Yoon
In emergency response operations, the role of unmanned aerial vehicles (UAVs) has become vital for performing tasks such as human detection. However, these tasks are computationally intensive, and UAVs have limited resources. Therefore, fixed-wing UAV mother-ships with edge servers (UMECs), which usually have more speed and payload capacity than rotary-wing UAVs, can be deployed near UAV scouts (generate the tasks) to provide processing services. However, the design of fixed-wing UAVs requires adherence to a minimum turning radius, which limits maneuverability and impacts both energy consumption and task execution time, thus necessitating careful trajectory planning. Furthermore, UMECs may lack the capacity to process all types of tasks due to memory restrictions and require both central processing units and graphics processing units for faster execution of tasks. Therefore, this paper aims to minimize the energy consumption in the network and task execution time by jointly optimizing the trajectory of UMECs, task offloading, and resource allocation (TTR) problem while taking into account UMECs movement constraints, task performance limitations, and computational resource budgets. In this regard, we first propose a particle swarm optimization (PSO)-based TTR scheme (P-TTR), where a PSO algorithm finds the trajectory solution, and a block coordinate descent-based method is developed to solve the task offloading and resource allocation problem. Then, for real-time decision-making, a deep reinforcement learning-based algorithm, namely soft-actor-critic-based TTR (S-TTR), is introduced to address the problem, which can adapt to dynamic environments and have lower computational overhead. Simulation results confirm that the proposed approaches can outperform the baseline method.

15 May 2024 in IEEE Access
Verified
Journal Article
Open access
SAShathee Akter
Shathee Akter
Dat Van Anh DuongDat Van Anh Duong
Dat Van Anh Duong
DKDae Young Kim
Dae Young Kim
SYSeokhoon Yoon
Seokhoon Yoon
In modern emergency responses, unmanned aerial vehicles (UAVs) play a crucial role in redefining disaster management through diverse task execution (e.g., object detection). However, UAVs are usually resource-constrained. To address this issue, UAV mother-ships with edge servers (UMECs) can be placed near UAV scouts for remote task processing. UMECs can have a larger scale of energy consumption and battery capacity thanUAVscouts. Therefore, minimizing the total or maximum energy consumption may result in ignoring the energy consumption in UAV scouts and focusing on UMECs, consequently reducing the network’s lifetime. Furthermore, UMECs might lack the capacity to process all types of tasks owing to memory or software restrictions, and faster task execution often necessitates both central processing unit (CPU) and graphics processing unit (GPU), which are rarely considered by existing works. Therefore, this paper studies a task offloading and resource (computation capacity and power) allocation (TORA) problem with the goal of minimizing the maximum energy consumption ratio among UMECs and UAV scouts alongside task execution latency ratio and total energy consumption, where tasks are executed using both CPU and GPU, each UMEC can execute a specific set of tasks, and devices have limited resources.We then formulate the problem as a non-convex mixed-integer nonlinear programming problem and decompose it into multiple sub-problems. Finally, a soft-actor-critic (SAC) based TORA algorithm (SATORA) is proposed to address the problem, which can adapt to the time-varying environment scenario. Numerical simulation results show that SATORA outperforms other baseline algorithms.

1 October 2019
Verified
Conference Paper
Closed access
Dat Van Anh DuongDat Van Anh Duong
Dat Van Anh Duong
SYSeokhoon Yoon
Seokhoon Yoon
Opportunistic network is one of the most interesting evolutions of MANETs. In opportunistic network, the frequent disconnection of nodes is very common. This is a huge challenge for an efficient routing protocol. Several routing protocols have been proposed but there are performance limitations such as the high overhead, the high delivery latency, and the low delivery rate. In order to solve those problems, we propose an efficient probabilistic routing algorithm based on limiting the number of replications (PRoPHET-L). Which considers the history of encounters to predict the meeting probability between two nodes and limits the number of replications to reduce overhead in the network. The proposed routing protocol is compared with other routing protocols. The obtained results indicate that PRoPHET-L can efficiently improve the delivery rate, the overhead ratio, and the delivery delay.

10 September 2024 in Electronics
Verified
Journal Article
Open access
PDF file
Dat Van Anh DuongDat Van Anh Duong
Dat Van Anh Duong
SAShathee Akter
Shathee Akter
SYSeokhoon Yoon
Seokhoon Yoon
This paper proposes a novel UAV-based edge computing system for augmented reality (AR) applications, addressing the challenges posed by the limited resources in mobile devices. The system uses UAVs equipped with edge computing servers (UECs) specifically to enable efficient task offloading and resource allocation for AR tasks with dependent relationships. This work specifically focuses on the problem of dependent tasks in AR applications within UAV-based networks. This problem has not been thoroughly addressed in previous research. A dual network architecture-based task offloading (DNA-TO) algorithm is proposed, leveraging the DNA framework to enhance decision-making in reinforcement learning while mitigating noise. In addition, a Karush–Kuhn–Tucker-based resource allocation (KKT-RA) algorithm is proposed to optimize resource allocation. Various simulations using real-world movement data are conducted. The results indicate that our proposed algorithm outperforms existing approaches in terms of latency and energy efficiency.

12 May 2021 in IEEE Access
Verified
Journal Article
Open access
Dat Van Anh DuongDat Van Anh Duong
Dat Van Anh Duong
DKDae-Young Kim
Dae-Young Kim
SYSeokhoon Yoon
Seokhoon Yoon
With the increasing number of smart device users, data transmission between users is becoming more important, and a network architecture called opportunistic mobile social network (OMSN) is gaining attention. However, routing in OMSNs is a challenging problem due to the frequent disconnection between nodes and the absence of paths from the source to the destination. It results in a complex topology and a low packet transmission success rate. Therefore, we propose a novel routing algorithm called the temporal social interactions-based routing protocol (TSIRP) for solving the problem of low network performance due to the improper selection of message relay nodes. First, we focus on the temporal context of social interactions. Specifically, at a certain time of the day, a person has specific people with whom the person usually interacts (e.g., workers usually meet co-workers during working hours; students usually meet their classmates during class). Based on temporal social interactions between nodes, potential forwarding metrics are proposed and calculated for each time of the day to make forwarding decisions. Second, we propose a new scheme to control the message spreading rate, which allows achieving a balance between delivery latency and overhead ratio. In addition, an analytical model is also designed using an absorbing Markov chain to estimate the performance of TSIRP. Simulations were also conducted, and the results indicate that TSIRP can achieve better performance than existing routing protocols in terms of packet delivery ratio, delivery latency, network overhead ratio, and average hop count.

28 January 2020 in Electronics
Verified
Journal Article
Open access
PDF file
Dat Van Anh DuongDat Van Anh Duong
Dat Van Anh Duong
SYSeokhoon Yoon
Seokhoon Yoon
Since human movement patterns are important for validating the performance of wireless networks, several traces of human movements in real life have been collected. However, collecting data about human movements is costly and time-consuming. Moreover, multiple traces are demanded to test various network scenarios. As a result, a lot of synthetic models of human movement have been proposed. Nevertheless, most of the proposed models were often based on random generation, and cannot produce realistic human movements. Although there have been a few models that tried to capture the characteristics of human movement in real life (e.g., flights, inter-contact times, and pause times following the truncated power-law distribution), those models still cannot reflect realistic human movements due to a lack of consideration for social context among people. To address those limitations, in this paper, we propose a novel human mobility model called the social relationship–aware human mobility model (SRMM), which considers social context as well as the characteristics of human movement. SRMM partitions people into social groups by exploiting information from a social graph. Then, the movements of people are determined by considering the distances to places and social relationships. The proposed model is first evaluated by using a synthetic map, and then a real road map is considered. The results of SRMM are compared with a real trace and other synthetic mobility models. The obtained results indicate that SRMM is consistently better at reflecting both human movement characteristics and social relationships.