Yawen Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yawen Zheng has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Kwan-Wu Chin
University of Wollongong
2 shared publications
Latest Publications
- 6 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (1) , 1431-1442
On Data Collection in SIC-Capable Space–Air–Ground Integrated IoT Networks
This article considers routing and uplinks scheduling in space–air–ground integrated networks. Specifically, it considers a successive interference cancellation-capable unmanned aerial vehicle (UAV) that collects data from ground devices operating in an Internet of Things network. Its objective is to maximize the minimum flow rate to a terrestrial gateway over a fixed time horizon. It outlines a mixed integer linear program (MILP) to optimize in each time slot: the routing from the UAV to the gateway, the set of links from ground devices to the UAV, and the flow rate over links. It also proposes a novel algorithm, called iterative flow and path reservation (IFPR), for use by the UAV to select paths. Further, IFPR uses two methods to schedule communications between ground devices and the UAV. The first method, called simplified MILP (SMILP), aims to maximize the sum rate from ground devices. The second method, called less data schedule first, prioritizes ground devices that have uploaded the least amount of data to the gateway. Numerical results show satellite links help the UAV collects 61% more data from ground devices. Moreover, as compared to the MILP, IFPR collects 23% less data. Further, for both MILP and IFPR, their Jain’s fairness index reaches around one when the number of time slots is sufficiently large. Finally, when IFPR uses SMILP, the gateway collects more data but at the expense of fairness.
- 6 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (1) , 1431-1442
On Data Collection in SIC-Capable Space–Air–Ground Integrated IoT Networks
This article considers routing and uplinks scheduling in space–air–ground integrated networks. Specifically, it considers a successive interference cancellation-capable unmanned aerial vehicle (UAV) that collects data from ground devices operating in an Internet of Things network. Its objective is to maximize the minimum flow rate to a terrestrial gateway over a fixed time horizon. It outlines a mixed integer linear program (MILP) to optimize in each time slot: the routing from the UAV to the gateway, the set of links from ground devices to the UAV, and the flow rate over links. It also proposes a novel algorithm, called iterative flow and path reservation (IFPR), for use by the UAV to select paths. Further, IFPR uses two methods to schedule communications between ground devices and the UAV. The first method, called simplified MILP (SMILP), aims to maximize the sum rate from ground devices. The second method, called less data schedule first, prioritizes ground devices that have uploaded the least amount of data to the gateway. Numerical results show satellite links help the UAV collects 61% more data from ground devices. Moreover, as compared to the MILP, IFPR collects 23% less data. Further, for both MILP and IFPR, their Jain’s fairness index reaches around one when the number of time slots is sufficiently large. Finally, when IFPR uses SMILP, the gateway collects more data but at the expense of fairness.
- Open Access
- 7 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 84756-84772
Joint Trajectory and Link Scheduling Optimization in UAV Networks
This paper considers data upload from multiple devices to a rotary-wing Unmanned Aerial Vehicle (UAV) equipped with a Successive Interference Cancellation (SIC) radio. The problem at hand is to optimize the UAV’s data collection points, and the set of transmitting devices at each point. We outline three contributions. The first is an Integer Linear Program (ILP), which can be used to compute the optimal trajectory and data transmission schedule. Second, we propose a novel heuristic called Iteratively Construct Link Schedule and Trajectory (ICLST) that includes a link set/schedule selection policy called Highest Sum-Rate Selection (HSRS). Third, we propose a novel learning-based protocol that enables a UAV to independently learn the optimal trajectory with the highest energy efficiency. Our results show that a SIC radio helps double the amount of data collected by the UAV. Placing devices at different heights helps the UAV collect more data. Moreover, ICLST with HSRS is capable of producing a schedule that is near optimal. Additionally, our learning protocol yields a schedule with the highest energy-efficiency.
- 7 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 84756-84772
Open AccessJoint Trajectory and Link Scheduling Optimization in UAV Networks
This paper considers data upload from multiple devices to a rotary-wing Unmanned Aerial Vehicle (UAV) equipped with a Successive Interference Cancellation (SIC) radio. The problem at hand is to optimize the UAV’s data collection points, and the set of transmitting devices at each point. We outline three contributions. The first is an Integer Linear Program (ILP), which can be used to compute the optimal trajectory and data transmission schedule. Second, we propose a novel heuristic called Iteratively Construct Link Schedule and Trajectory (ICLST) that includes a link set/schedule selection policy called Highest Sum-Rate Selection (HSRS). Third, we propose a novel learning-based protocol that enables a UAV to independently learn the optimal trajectory with the highest energy efficiency. Our results show that a SIC radio helps double the amount of data collected by the UAV. Placing devices at different heights helps the UAV collect more data. Moreover, ICLST with HSRS is capable of producing a schedule that is near optimal. Additionally, our learning protocol yields a schedule with the highest energy-efficiency.