Cuntao Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Cuntao Liu has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Yan Guo
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
5 shared publications - Wendong Zhao
Communications Engineering College, Army Engineering University of PLA, Nanjing 210000, China
4 shared publications Ning Li
Communications Engineering College, Army Engineering University of PLA, Nanjing, China
3 shared publications- Aijing Li
College of Communications Engineering, Army Engineering University of PLA, Nanjing 210042, China
2 shared publications Bin Zhou
Communications Engineering College Army Engineering University of PLA Nanjing China
2 shared publications- Duan Xue
Communication Engineering College, PLA Army Engineering University, China and College of Mathematics and Computer Science, Liupanshui Normal University, China
1 shared publication
Latest Publications
- Open Access
Task Assignment Optimization in Multi-UAV-Assisted WSNs Considering Energy Budget and Sensor Distribution Characteristics
In emergency situations, such as disaster area monitoring, deadlines for data collection are strict. The task time minimization problem concerning multi-UAV-assisted data collection in wireless sensor networks (WSNs), with different distribution characteristics, such as the geographical or importance of the information of the sensors, is studied. Our goal is to minimize the mission time for UAVs by optimizing their assignment, trajectory, and deployment locations, while the UAV energy constraint is taken into account. For the coupling relationship between the task assignment, trajectory, and hover position, it is not easy to solve the mixed integer non-convex problem directly. The problem is divided into two sub-problems: (1) UAV task assignment problem and (2) trajectory and hover position optimization problem. To solve this problem, an assignment algorithm, based on sensor distribution characteristics (AASDC), is proposed. The simulation results show that the collection time of our scheme is shorter than that of existing comparison schemes when using the same data size.
Open AccessTask Assignment Optimization in Multi-UAV-Assisted WSNs Considering Energy Budget and Sensor Distribution Characteristics
In emergency situations, such as disaster area monitoring, deadlines for data collection are strict. The task time minimization problem concerning multi-UAV-assisted data collection in wireless sensor networks (WSNs), with different distribution characteristics, such as the geographical or importance of the information of the sensors, is studied. Our goal is to minimize the mission time for UAVs by optimizing their assignment, trajectory, and deployment locations, while the UAV energy constraint is taken into account. For the coupling relationship between the task assignment, trajectory, and hover position, it is not easy to solve the mixed integer non-convex problem directly. The problem is divided into two sub-problems: (1) UAV task assignment problem and (2) trajectory and hover position optimization problem. To solve this problem, an assignment algorithm, based on sensor distribution characteristics (AASDC), is proposed. The simulation results show that the collection time of our scheme is shorter than that of existing comparison schemes when using the same data size.
- Open Access
- 12 May 2023
- Published by MDPI AG in Electronics
- Vol. 12 (10) , 2212
Resource Allocation and Trajectory Optimization in OTFS-Based UAV-Assisted Mobile Edge Computing
Mobile edge computing (MEC) powered by unmanned aerial vehicles (UAVs), with the advantages of flexible deployment and wide coverage, is a promising technology to solve computationally intensive communication problems. In this paper, an orthogonal time frequency space (OTFS)-based UAV-assisted MEC system is studied, in which OTFS technology is used to mitigate the Doppler effect in UAV high-speed mobile communication. The weighted total energy consumption of the system is minimized by jointly optimizing the time division, CPU frequency allocation, transmit power allocation and flight trajectory while considering Doppler compensation. Thus, the resultant problem is a challenging nonconvex problem. We propose a joint algorithm that combines the benefits of the atomic orbital search (AOS) algorithm and convex optimization. Firstly, an improved AOS algorithm is proposed to swiftly obtain the time slot allocation and high-quality solution of the UAV optimal path. Secondly, the optimal solution for the CPU frequency and transmit power allocation is found by using Lagrangian duality and the first-order Taylor formula. Finally, the optimal solution of the original problem is iteratively obtained. The simulation results show that the weighted total energy consumption of the OTFS-based system decreases by 13.6% compared with the orthogonal frequency division multiplexing (OFDM)-based system. The weighted total energy consumption of the proposed algorithm decreases by 11.7% and 26.7% compared with convex optimization and heuristic algorithms, respectively.
- 12 May 2023
- Published by MDPI AG in Electronics
- Vol. 12 (10) , 2212
Open AccessResource Allocation and Trajectory Optimization in OTFS-Based UAV-Assisted Mobile Edge Computing
Mobile edge computing (MEC) powered by unmanned aerial vehicles (UAVs), with the advantages of flexible deployment and wide coverage, is a promising technology to solve computationally intensive communication problems. In this paper, an orthogonal time frequency space (OTFS)-based UAV-assisted MEC system is studied, in which OTFS technology is used to mitigate the Doppler effect in UAV high-speed mobile communication. The weighted total energy consumption of the system is minimized by jointly optimizing the time division, CPU frequency allocation, transmit power allocation and flight trajectory while considering Doppler compensation. Thus, the resultant problem is a challenging nonconvex problem. We propose a joint algorithm that combines the benefits of the atomic orbital search (AOS) algorithm and convex optimization. Firstly, an improved AOS algorithm is proposed to swiftly obtain the time slot allocation and high-quality solution of the UAV optimal path. Secondly, the optimal solution for the CPU frequency and transmit power allocation is found by using Lagrangian duality and the first-order Taylor formula. Finally, the optimal solution of the original problem is iteratively obtained. The simulation results show that the weighted total energy consumption of the OTFS-based system decreases by 13.6% compared with the orthogonal frequency division multiplexing (OFDM)-based system. The weighted total energy consumption of the proposed algorithm decreases by 11.7% and 26.7% compared with convex optimization and heuristic algorithms, respectively.
- Open Access
- 3 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 205-211
Dynamic resource allocation on Vehicular edge computing and communication
The improvement of modern communication technology has made the Internet of Vehicles (IoV) advance by leaps and bounds, and promotes the progress of many technologies, such as mobile sensing, vehicular edge computing, sensor networks, satellite positioning, data analysis, etc. Vehicular edge computing (VEC) is an innovative computing paradigm which can provide flexible and reliable computation services for intelligent and connected vehicles. An optimized problem is formulated to minimize the total task offloading time delay by making a tradeoff between vehicle mobility and task nature. To tackle the optimization problem, we proposed the Delay-sensitive half-Determined atomic Search algorithm, called DeshDaS, in which we regard each intelligent vehicle as an atom and strategy as electron and consider electron transition process. Experimental results validate the effectiveness and superior of our algorithm compared with several existed offloading strategy, and the larger average amount of data waiting to be processed, the more significant our advantage is.
- 3 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 205-211
Open AccessDynamic resource allocation on Vehicular edge computing and communication
The improvement of modern communication technology has made the Internet of Vehicles (IoV) advance by leaps and bounds, and promotes the progress of many technologies, such as mobile sensing, vehicular edge computing, sensor networks, satellite positioning, data analysis, etc. Vehicular edge computing (VEC) is an innovative computing paradigm which can provide flexible and reliable computation services for intelligent and connected vehicles. An optimized problem is formulated to minimize the total task offloading time delay by making a tradeoff between vehicle mobility and task nature. To tackle the optimization problem, we proposed the Delay-sensitive half-Determined atomic Search algorithm, called DeshDaS, in which we regard each intelligent vehicle as an atom and strategy as electron and consider electron transition process. Experimental results validate the effectiveness and superior of our algorithm compared with several existed offloading strategy, and the larger average amount of data waiting to be processed, the more significant our advantage is.
- Open Access
Completion Time Minimization for UAV-UGV-Enabled Data Collection
In unmanned aerial vehicle (UAV)-enabled data collection systems, situations where sensor nodes (SNs) cannot upload their data successfully to the UAV may exist, due to factors such as SNs’ insufficient energy and the UAV’s minimum flight altitude. In this paper, an unmanned ground vehicle (UGV)-UAV-enabled data collection system is studied, where data collection missions are conducted by a UAV and a UGV cooperatively. Two cooperative strategies are proposed, i.e., collaboration without information interaction, and collaboration with information interaction. In the first strategy, the UGV collects data from remote SNs (i.e., the SNs that cannot upload data to the UAV) as well as some normal SNs (i.e., the SNs that can upload data to the UAV), while the UAV only collects data from some normal SNs. Then, they carry the data back to the data center (DC) without interacting with each other. In the second strategy, the UGV only collects data from remote SNs, while transmitting the collected data to the UAV at a data interaction point, then the data are carried back to the DC by the UAV. There are mobile data collection nodes on the ground and in the air, and the task is to find trajectories to minimize the data collection time in the data center. A collaborative strategy selection algorithm, combining a multi-stage-based SN association and UAV-UGV path optimization algorithm, is proposed to solve the problem effectively, where techniques including convex optimization and genetic algorithm are adopted. The simulation result shows that the proposed scheme reduces the mission completion time by 36% compared with the benchmark scheme.
Open AccessCompletion Time Minimization for UAV-UGV-Enabled Data Collection
In unmanned aerial vehicle (UAV)-enabled data collection systems, situations where sensor nodes (SNs) cannot upload their data successfully to the UAV may exist, due to factors such as SNs’ insufficient energy and the UAV’s minimum flight altitude. In this paper, an unmanned ground vehicle (UGV)-UAV-enabled data collection system is studied, where data collection missions are conducted by a UAV and a UGV cooperatively. Two cooperative strategies are proposed, i.e., collaboration without information interaction, and collaboration with information interaction. In the first strategy, the UGV collects data from remote SNs (i.e., the SNs that cannot upload data to the UAV) as well as some normal SNs (i.e., the SNs that can upload data to the UAV), while the UAV only collects data from some normal SNs. Then, they carry the data back to the data center (DC) without interacting with each other. In the second strategy, the UGV only collects data from remote SNs, while transmitting the collected data to the UAV at a data interaction point, then the data are carried back to the DC by the UAV. There are mobile data collection nodes on the ground and in the air, and the task is to find trajectories to minimize the data collection time in the data center. A collaborative strategy selection algorithm, combining a multi-stage-based SN association and UAV-UGV path optimization algorithm, is proposed to solve the problem effectively, where techniques including convex optimization and genetic algorithm are adopted. The simulation result shows that the proposed scheme reduces the mission completion time by 36% compared with the benchmark scheme.
- 10 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (21) , 21777-21791
AoI-Minimal Task Assignment and Trajectory Optimization in Multi-UAV-Assisted IoT Networks
This article investigates an unmanned-aerial-vehicle (UAV)-assisted Internet of Things system, where multiple UAVs take off from a data center (DC), collect data from multiple ground sensor nodes (SNs), distribute data for multiple users, and finally return to DC. A centralized information-sharing mechanism is designed among UAVs before data distribution, such that UAVs’ repeatedly visiting the same user can be avoided to save energy and time. A nonconvex Age-of-Information (AoI) minimization problem is formulated, where the task assignment, selection of interaction point (IPT), and UAVs’ trajectories are optimized jointly. It is decomposed into two subproblems: one is a joint task assignment and UAV trajectory optimization problem, which is solved by a multipopulation-based genetic algorithm (MPGA), as well as a hybrid algorithm combining dynamic programming (DP) with an improved $K$ -means clustering; and the other is an IPT selection problem, which is modeled as a Fermat–Weber location problem and is solved by the convex optimization technique. Simulation results show that the MPGA performs better than the hybrid algorithm as well as several benchmark algorithms.
- 10 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (21) , 21777-21791
AoI-Minimal Task Assignment and Trajectory Optimization in Multi-UAV-Assisted IoT Networks
This article investigates an unmanned-aerial-vehicle (UAV)-assisted Internet of Things system, where multiple UAVs take off from a data center (DC), collect data from multiple ground sensor nodes (SNs), distribute data for multiple users, and finally return to DC. A centralized information-sharing mechanism is designed among UAVs before data distribution, such that UAVs’ repeatedly visiting the same user can be avoided to save energy and time. A nonconvex Age-of-Information (AoI) minimization problem is formulated, where the task assignment, selection of interaction point (IPT), and UAVs’ trajectories are optimized jointly. It is decomposed into two subproblems: one is a joint task assignment and UAV trajectory optimization problem, which is solved by a multipopulation-based genetic algorithm (MPGA), as well as a hybrid algorithm combining dynamic programming (DP) with an improved $K$ -means clustering; and the other is an IPT selection problem, which is modeled as a Fermat–Weber location problem and is solved by the convex optimization technique. Simulation results show that the MPGA performs better than the hybrid algorithm as well as several benchmark algorithms.
- Open Access
- 13 October 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-14
On-Demanding Information Acquisition in Multi-UAV-Assisted Sensor Network: A Satisfaction-Driven Perspective
When multiple heterogeneous unmanned aerial vehicles (UAVs) provide service for multiple users in sensor networks, users’ diverse priorities and corresponding priority-related satisfaction are rarely concerned in traditional task assignment algorithms. A priority-driven user satisfaction model is proposed, in which a piecewise function considering soft time window and users’ different priority levels is designed to describe the relationship between user priority and user satisfaction. On this basis, the multi-UAV task assignment problem is formulated as a combinatorial optimization problem with multiple constraints, where the objective is maximizing the priority-weighted satisfaction of users while minimizing the total energy consumption of UAVs. A multipopulation-based cooperation genetic algorithm (MPCGA) by adapting the idea of “exploration-exploitation” into traditional genetic algorithms (GAs) is proposed, which can solve the task assignment problem in polynomial time. Simulation results show that compared with the algorithm without considering users’ priority-based satisfaction, users’ weighted satisfaction can be improved by about 47% based on our algorithm in situations where users’ information acquisition is tight time-window constraints. In comparison, UAVs’ energy consumption only increased by about 6%. Besides, compared with traditional GA, our proposed algorithm can also improve users’ weighted satisfaction by about 5% with almost the same energy consumption of UAVs.
- 13 October 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-14
Open AccessOn-Demanding Information Acquisition in Multi-UAV-Assisted Sensor Network: A Satisfaction-Driven Perspective
When multiple heterogeneous unmanned aerial vehicles (UAVs) provide service for multiple users in sensor networks, users’ diverse priorities and corresponding priority-related satisfaction are rarely concerned in traditional task assignment algorithms. A priority-driven user satisfaction model is proposed, in which a piecewise function considering soft time window and users’ different priority levels is designed to describe the relationship between user priority and user satisfaction. On this basis, the multi-UAV task assignment problem is formulated as a combinatorial optimization problem with multiple constraints, where the objective is maximizing the priority-weighted satisfaction of users while minimizing the total energy consumption of UAVs. A multipopulation-based cooperation genetic algorithm (MPCGA) by adapting the idea of “exploration-exploitation” into traditional genetic algorithms (GAs) is proposed, which can solve the task assignment problem in polynomial time. Simulation results show that compared with the algorithm without considering users’ priority-based satisfaction, users’ weighted satisfaction can be improved by about 47% based on our algorithm in situations where users’ information acquisition is tight time-window constraints. In comparison, UAVs’ energy consumption only increased by about 6%. Besides, compared with traditional GA, our proposed algorithm can also improve users’ weighted satisfaction by about 5% with almost the same energy consumption of UAVs.
- Open Access
- 11 October 2021
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2021, 1-14
A User-Priority-Driven Multi-UAV Cooperative Reconnaissance Strategy
This paper considers a reconnaissance scenario where multiple unmanned aerial vehicles (UAVs) provide services cooperatively for multiple users with different priorities. Although users all expect to acquire their needed information in a short time, the degree of urgency to meet their demands is different when taking their diverse priorities into account. A priority-driven multiuser satisfaction model is designed, where users’ satisfaction is quantified based on their different priorities, information acquisition demands, and the time they obtain their desired information. To ensure high priority users’ fast information acquisition while avoiding excessive delay in low priority users’ information acquisition, a batchwise information backhaul strategy is adopted. In each batch, a UAV is selected as the data ferry through a consultative mechanism to carry information back to users. This reconnaissance process is formulated as a cooperative path planning problem, where the optimization objective is maximizing users’ total satisfaction, while an intelligent algorithm is proposed to solve this problem effectively. The simulation results show that compared with traditional path planning algorithms without considering user satisfaction, our proposed algorithm can guarantee faster information acquisition for users with higher priorities, which leads to higher satisfaction. In addition, the applicability of our proposed reconnaissance strategy and path planning algorithm in different situations is also analyzed.
- 11 October 2021
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2021, 1-14
Open AccessA User-Priority-Driven Multi-UAV Cooperative Reconnaissance Strategy
This paper considers a reconnaissance scenario where multiple unmanned aerial vehicles (UAVs) provide services cooperatively for multiple users with different priorities. Although users all expect to acquire their needed information in a short time, the degree of urgency to meet their demands is different when taking their diverse priorities into account. A priority-driven multiuser satisfaction model is designed, where users’ satisfaction is quantified based on their different priorities, information acquisition demands, and the time they obtain their desired information. To ensure high priority users’ fast information acquisition while avoiding excessive delay in low priority users’ information acquisition, a batchwise information backhaul strategy is adopted. In each batch, a UAV is selected as the data ferry through a consultative mechanism to carry information back to users. This reconnaissance process is formulated as a cooperative path planning problem, where the optimization objective is maximizing users’ total satisfaction, while an intelligent algorithm is proposed to solve this problem effectively. The simulation results show that compared with traditional path planning algorithms without considering user satisfaction, our proposed algorithm can guarantee faster information acquisition for users with higher priorities, which leads to higher satisfaction. In addition, the applicability of our proposed reconnaissance strategy and path planning algorithm in different situations is also analyzed.
- Open Access
- 6 July 2021
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 57 (21) , 819-822
Multi‐UAV cooperative trajectory optimisation for a multi‐hop UAV relaying network
In this letter, an unmanned aerial vehicle (UAV) assisted data collection scenario is considered in the Internet of Things (IoT), where a multi‐hop UAV relaying network is constructed for real‐time data transmission. Taking the minimisation of the completion time of data collection, a non‐convex multi‐UAV trajectory optimisation problem is formulated, and it is converted to a cooperative hover position selection problem when “Hover‐Forwarding” data transmission mode is adopted. “Equal Distance” hover location selection scheme is proposed and analysed theoretically, based on which, an improved adaptive differential evolution algorithm (IADEA) is proposed to solve the hover position selection problem effectively. Simulation results show that IADEA can achieve an objective value that is no more than 8% higher than the optimal value, and it is more efficient than traditional genetic algorithm.
- 6 July 2021
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 57 (21) , 819-822
Open AccessMulti‐UAV cooperative trajectory optimisation for a multi‐hop UAV relaying network
In this letter, an unmanned aerial vehicle (UAV) assisted data collection scenario is considered in the Internet of Things (IoT), where a multi‐hop UAV relaying network is constructed for real‐time data transmission. Taking the minimisation of the completion time of data collection, a non‐convex multi‐UAV trajectory optimisation problem is formulated, and it is converted to a cooperative hover position selection problem when “Hover‐Forwarding” data transmission mode is adopted. “Equal Distance” hover location selection scheme is proposed and analysed theoretically, based on which, an improved adaptive differential evolution algorithm (IADEA) is proposed to solve the hover position selection problem effectively. Simulation results show that IADEA can achieve an objective value that is no more than 8% higher than the optimal value, and it is more efficient than traditional genetic algorithm.
- 2 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (4) , 907-911
Multiuser Oriented Multi-UAV Mission Assignment With Cooperative Information Sharing
Due to the overlap of different users’ information requirements for reconnaissance targets, when unmanned aerial vehicles (UAVs), serving multiple users, perform field reconnaissance missions, it is likely to cause repetitive visit to the same targets. To deal with this problem, a reasonable cooperative mission assignment algorithm is needed. By introducing information sharing mechanism with air communication among UAVs, this letter models the mission assignment problem as a vehicle routing problem with air information sharing (VRPAIS), which can efficiently avoid the repetitive visit of targets. An improved piecewise genetic algorithm with integer splitting is proposed to solve VRPAIS in polynomial time. Simulation results show that in the case of high overlap (about 80%) of information requirements, the proposed method is much more energy efficient compared with the traditional Multiple Traveling Salesman Problem (MTSP) based method without information sharing, with an average energy savings rate of 34.2%.
- 2 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (4) , 907-911
Multiuser Oriented Multi-UAV Mission Assignment With Cooperative Information Sharing
Due to the overlap of different users’ information requirements for reconnaissance targets, when unmanned aerial vehicles (UAVs), serving multiple users, perform field reconnaissance missions, it is likely to cause repetitive visit to the same targets. To deal with this problem, a reasonable cooperative mission assignment algorithm is needed. By introducing information sharing mechanism with air communication among UAVs, this letter models the mission assignment problem as a vehicle routing problem with air information sharing (VRPAIS), which can efficiently avoid the repetitive visit of targets. An improved piecewise genetic algorithm with integer splitting is proposed to solve VRPAIS in polynomial time. Simulation results show that in the case of high overlap (about 80%) of information requirements, the proposed method is much more energy efficient compared with the traditional Multiple Traveling Salesman Problem (MTSP) based method without information sharing, with an average energy savings rate of 34.2%.
- Open Access
- 25 December 2019
- Published by MDPI AG in Applied Sciences
- Vol. 10 (1) , 184
A Heterogeneous Battlefield Situation Information Sharing Method Based on Content
Various information systems adopt different information category standards and description methods even for the same battlefield space. This leads to the heterogeneity of information distributed in different systems, which hinders the information sharing among different systems. In this paper, we adopt the idea of schema mapping and design a framework of realizing heterogeneous information sharing based on content. We design a concept-logic tree model to organize the battlefield situation information and realize the mapping from local concept models in different systems to a global unified concept model. By constructing a unified information space, we realize the centralized organization, storage, and management of entity description information. Then, the information broadcasting mechanism and content based information query mechanism are designed to realize information sharing. Theoretical analysis and experiment results verify the effectiveness of the proposed framework.
- 25 December 2019
- Published by MDPI AG in Applied Sciences
- Vol. 10 (1) , 184
Open AccessA Heterogeneous Battlefield Situation Information Sharing Method Based on Content
Various information systems adopt different information category standards and description methods even for the same battlefield space. This leads to the heterogeneity of information distributed in different systems, which hinders the information sharing among different systems. In this paper, we adopt the idea of schema mapping and design a framework of realizing heterogeneous information sharing based on content. We design a concept-logic tree model to organize the battlefield situation information and realize the mapping from local concept models in different systems to a global unified concept model. By constructing a unified information space, we realize the centralized organization, storage, and management of entity description information. Then, the information broadcasting mechanism and content based information query mechanism are designed to realize information sharing. Theoretical analysis and experiment results verify the effectiveness of the proposed framework.