Average AoI minimization for data collection in UAV-enabled IoT backscatter communication systems with the finite blocklength regime
Yanyan Shen, Weiran Luo, Shuqiang Wang, Xiaoxia Huang
Abstract
Thanks to the autonomy of unmanned aerial vehicle (UAV), UAV-enabled data collection in Internet of Things (IoT) networks has become a key application for the next generation communication network. In this paper, we consider a scenario where an UAV is responsible for collecting data from sensor equipments (SEs) one by one and finally carrying the collected data to the computation center for processing. Different from the commonly used assumption that SEs always generate data at the beginning of each time slot, it is assumed that SEs can generate data at any instant during one time slot, which is more practical. Since SEs are energy limited, they upload data to the UAV by adopting backscatter communication technology to reduce energy consumption. Meanwhile, the updated information usually contains a small number of information bits but requires low latency and high reliability, thus the finite blocklength regime in ultra-reliable and low-latency communication is adopted for SEs’ data transmission to the UAV. To keep the freshness of the updated information, a joint resource allocation problem including data collection time allocation, transmission power and trajectory design of the UAV is formulated as an optimization problem to minimize the average age of information (AoI) of all SEs. The formulated problem mixes discrete and continuous variables, which makes it difficult to solve. Thereby, we decompose the optimization problem into data collection time minimization subproblem and UAV trajectory design subproblem, which are solved by the successive convex approximation method, and the backtracking algorithm and the genetic algorithm , respectively. Numerical results show that the backtracking-based algorithm that can obtain the optimal trajectory of the UAV gains the minimal average AoI, and the genetic-based algorithm achieves sub-optimal average AoI with much lower computational complexity. The results also demonstrate that the average AoI of the backtracking-based algorithm and the genetic-based algorithm is reduced by up to 54% and 46% compared with the greedy-based benchmark algorithm, respectively.