Shathee Akter

Ms. Shathee Akter

orcid

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
6 March 2023 in IEEE Access
Verified
Journal Article
Open access
SAShathee Akter
Shathee Akter
DKDae Young Kim
Dae Young Kim
SYSeokhoon Yoon
Seokhoon Yoon
In emergency response operations, using uncrewed aerial vehicles (UAVs) has recently become a promising solution due to their flexibility and easy deployment. However, tasks performed by the UAVs, e.g., object detection and human pose recognition, usually require a high computation capacity and energy supply. Furthermore, offloading tasks to the edge server-equipped base stations may not always be possible because of a lack of infrastructure or distance. Therefore, UAV-aided edge servers can be deployed near UAV scouts to provide computing services. However, a UAV can not perform all types of tasks since it has limitations on memory, available software, central processing unit (CPU), and graphics processing unit (GPU) capacity. Therefore, this study focuses on task offloading (TO), power, and computation resource allocation (PRA) problems in a multi-layer MEC-enabled UAV network while taking into account CPU and GPU requirements of tasks, the capacity of the devices (i.e., computational resources, power, and energy), and limitations on the type of tasks a UAV can perform. The problem is formulated as a non-convex mixed-integer nonlinear problem to minimize the weighted sum of the maximum energy consumption ratio in the network and total task execution latency ratio, and then decomposed and converted into an integer and a convex problem. A messy genetic algorithm (mGA)-based TO and PRA strategy (mGA-TPR) is proposed to solve the problem, where two PRA strategies are based on the Karush–Kuhn–Tucker conditions used to solve the PRA problem. Simulation results verify that the proposed scheme can outperform the baseline methods.

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.

5 July 2021 in IEEE Access
Verified
Journal Article
Open access
SAShathee Akter
Shathee Akter
TDThi-Nga Dao
Thi-Nga Dao
SYSeokhoon Yoon
Seokhoon Yoon
Mobile crowd-sensing (MCS) is a data collection paradigm, which recruits mobile users with smart devices to perform sensing tasks on a city-wide scale. In MCS, a key challenge is task allocation, especially when MCS applications are time-sensitive, and the platform needs to consider task completion order (since a worker may perform multiple tasks and different task completion orders lead to different travel costs and response times, i.e., the times needed to arrive at the task venues), requirements of tasks (such as deadline and required sensor) and workers heterogeneity. In other words, the task allocation problem consists of multiple task completion order problems, which is challenging to solve due to the large solution space. Therefore, in this paper, we first formulate the considered problem into two related integer linear programming problems (i.e., assignment and task completion order problems) using a decomposition technique in order to reduce the problem size and enable the use of diverse searching strategies. Then, a deep Q-learning (DQN)-based algorithm, namely assignment DQN with a local search (A-DQN w/ LS), is proposed to determine the task-worker assignments, which iteratively employs an asymmetric traveling salesman (ATSP) heuristic to find the task completion orders of the workers. The local optimizer is applied at the end of the A-DQN algorithm to deal with the computation time and local optima. Simulation results show that the proposed method outperforms existing approaches under different sensing dynamics in terms of total cost.

13 November 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SRSHAKILA RAHMAN
SHAKILA RAHMAN
SAShathee Akter
Shathee Akter
SYSeokhoon Yoon
Seokhoon Yoon
Unmanned aerial vehicles (UAVs) are used widely for data collection in wireless sensor networks (WSNs). UAVs visit the sensors to collect the data. UAV-aided data collection is a challenging problem because different paths of a UAV, i.e., visiting orders of sensors, affect energy consumption and data delivery times. The problem becomes more difficult when there are obstacles in the path of the UAV. Thus, the UAV needs to take a detour to avoid them, resulting in different travel distances and times. Therefore, this study formulated the obstacle-aware path planning problem of UAVs, i.e., the obstacle-constrained distance minimization (OCDM) problem, as an integer linear programming problem (ILP) to minimize the total traveling distances of all UAVs while considering the UAVs’ flight time constraints. First, a possible detour-points-selection algorithm called vector rotation-angle-based obstacle avoidance (VRAOA) is proposed to find the detour points around each obstacle in the environment. Then, a genetic algorithm with VRAOA (GA w/VRAOA)is developed to find the trajectories of the UAVs, using the VRAOA and Dijkstra algorithm to find a detour path if there is an obstacle between any two sensors. Finally, simulations were performed for algorithm variants, where GA w/VRAOA outperformed others.

24 December 2024 in Electronics
Verified
Journal Article
Open access
PDF file
SRSHAKILA RAHMAN
SHAKILA RAHMAN
SAShathee Akter
Shathee Akter
SYSeokhoon Yoon
Seokhoon Yoon
Unmanned aerial vehicles (UAVs) play a crucial role in various applications, including environmental monitoring, disaster management, and surveillance, where timely data collection is vital. However, their effectiveness is often hindered by the limitations of wireless sensor networks (WSNs), which can restrict communications due to bandwidth constraints and limited energy resources. Thus, the operational context of the UAV is intertwined with the constraints on WSNs, influencing how they are deployed and the strategies used to optimize their performance in these environments. Considering the issues, this paper addresses the challenge of efficient UAV navigation in constrained environments while reliably collecting data from WSN nodes, recharging the sensor nodes’ power supplies, and ensuring the UAV detours around obstacles in the flight path. First, an integer linear programming (ILP) optimization problem named deadline and obstacle-constrained energy minimization (DOCEM) is defined and formulated to minimize the total energy consumption of the UAV. Then, a deep reinforcement learning-based algorithm, named the DQN-based UAV detouring algorithm, is proposed to enable the UAV to make intelligent detour decisions in the constrained environment. The UAV must finish its tour (data collection and recharging sensors) without exceeding its battery capacity, ensuring each sensor has the minimum residual energy and consuming energy for transmitting and generating data, after being recharged by the UAV at the end of the tour. Finally, simulation results demonstrate the effectiveness of the proposed DQN-based UAV detouring algorithm in data collection and recharging the sensors while minimizing the total energy consumption of the UAV. Compared to other baseline algorithm variants, the proposed algorithm outperforms all of them.