15 May 2020 in IEEE Transactions on Vehicular Technology
In this paper, we consider parallel and sequential task offloading to multiple mobile edge computing servers. The task consists of a set of inter-dependent sub-tasks, which are scheduled to servers to minimize both offloading latency and failure probability. Two algorithms are proposed to solve the scheduling problem, which are based on genetic algorithm and conflict graph models, respectively. Simulation results show that these algorithms provide performance close to the optimal solution, which is obtained through exhaustive search. Furthermore, although parallel offloading uses orthogonal channels, results demonstrate that the sequential offloading yields a reduced offloading failure probability when compared to the parallel offloading. On the other hand, parallel offloading provides less latency. However, as the dependency among sub-tasks increases, the latency gap between parallel and sequential schemes decreases.
24 August 2020 in IEEE Wireless Communications Letters
In this paper, we address the problem of minimizing the energy consumption of disseminating a library of files to a set of Internet-of-things (IoT) devices using an unmanned aerial vehicle (UAV). A framework is provided, in which a subset of devices are selected to receive data from a UAV then forward the required data to other devices. Furthermore, optimal energy-efficient path selection is considered in order to realize efficient data dissemination. Specifically, an optimization problem is formulated to minimize the energy expenditure of the IoT devices and UAV while the latter tours to disseminate the required files to the former. An ant colony optimization (ACO) algorithm is developed to solve the optimization problem. Simulation results show that the proposed framework is more energy-efficient compared to a baseline approach, where the UAV hovers above each device to deliver the data. Results also illustrate that the proposed ACO algorithm provides performance close to the optimal solution, which is obtained through exhaustive search.
21 October 2019 in IEEE Communications Letters
In this letter, a collision-free sequential task offloading scheme to multiple mobile-edge computing servers is proposed. The problem is formulated as a multi-objective optimization of latency and offloading failure probability. An exact solution technique is developed to obtain a benchmark optimal solution for the problem. A more computationally efficient heuristic algorithm is additionally developed, whose sub-optimal solution yields a performance close to optimal. Simulation results illustrate that the proposed offloading scheme can effectively reduce both latency and offloading failure probability.
25 February 2025 in IEEE Transactions on Communications
Integrated sensing and communication (ISAC) is an emerging technique to enable radar and communication systems deployment on a shared hardware, channel characteristics, signal processing methods, etc. This integration improves the deployment efficiency and requires more sophisticated resource allocation and optimization techniques. The ISAC signal is designed to sense targets and to carry private information which could be at risk of being eavesdropped. This paper considers an ISAC framework in which a set of aerial eavesdroppers poses the threat of intercepting the downlink communication from a base station to a set of users. The eavesdroppers are moving, and their unknown locations are estimated based on the echo signal. A maximum likelihood-based scheme is developed to estimate the eavesdroppers’ channels, including coarse estimation with refines to estimate each eavesdropper’s complex channel gain, elevation and azimuth angles. The corresponding Cramér-Rao lower bounds of the estimated parameters are also provided. Given that the eavesdroppers are moving, a long short-term memory (LSTM) deep network is employed to predict their channels and also to enable a less frequent estimation process. Meta-learner LSTM is also presented to provide few-shot learning and provide generalization capability to any trajectory with a few fine-tuning steps. Based on the predicted eavesdroppers’ channels, two secure precoding algorithms are developed based on successive convex approximation and zero forcing techniques to improve the sum secrecy rate for the users. Simulation results illustrate that the developed framework provides substantial improvement in communication secrecy when compared with other benchmark approaches.
4 October 2021 in IEEE Transactions on Vehicular Technology
In this paper, we consider an underwater linear network, where an autonomous underwater vehicle (AUV) gathers data from a set of underwater devices. The AUV monitors a set of physical processes, where the status of each process can be sensed by one or more devices and each device is capable of sensing one or more processes. The AUV needs to maintain freshness of its information status about the monitored processes. To quantify the freshness of the information at the AUV, we consider the concept of the age of information (AoI), which represents the amount of time elapsed since the most recently delivered update information was generated. A framework is proposed to optimize the AUV's linear movement trajectory and scheduling of process status updates with the objective of minimizing the normalized weighted sum of the average AoI of the monitored physical processes. The formulated optimization problem is a non-convex mixed integer problem, which cannot be solved by the standard optimization techniques. We develop a solution approach based on the technique of deep reinforcement learning (DRL). Specifically, we leverage an actor-critic DRL approach to find the optimum locations and stopping time of the data gathering points. Simulation results illustrate that the proposed framework maintains robustness under different scenarios and provides better performance when compared with baseline and $K$ -means clustering approaches.
23 August 2022 in IEEE Internet of Things Journal
This article focuses on minimizing the energy consumption of a fleet of unmanned aerial vehicles (UAVs) disseminating information to a set of Internet of Things devices. In the considered scenario, each device wants to download a subset of files from a library of files. Considering the storage capacity of the UAVs, a framework is provided that minimizes energy consumption by optimally selecting the contributing UAVs, placing files, and planning the trajectory of each contributing UAV. In this framework, a combinatorial optimization problem is formulated, which is hard to solve directly for a practical number of devices, files, and/or UAVs. In order to tackle this challenge, we develop three solution approaches, namely, a multichromosome genetic algorithm (GA), a hybrid genetic-ant colony algorithm, and a GA with heuristic file placement. Results show that the proposed solution approaches minimize the total energy consumption and provide near-optimal solutions. Results also illustrate that the proposed framework optimizes the number of UAVs participating in the information delivery mission.