ESTA: An Efficient Spatial-Temporal Range Aggregation Query Processing Algorithm for UAV Networks
Unmanned Aerial Vehicle (UAV) networks have been widely used in both military and civilian scenarios. When users are interested in the statistical information of the historical sensory data in a certain region during a certain time period, they will send an aggregation query request with a spatial-temporal constraint to target UAVs which store the qualified data. Then, the target UAVs will return the query results to users. Meanwhile, the query results can be aggregated within the network during transmission to save energy and bandwidth resources, which are typically scarce in UAV networks. However, due to the unique characteristics of UAV networks, it is difficult to perform efficient in-network aggregation of query results without the sacrifice of the user query delay. To the best of our knowledge, there is no research on spatial-temporal range aggregation query in UAV networks. In this paper, we propose an Efficient Spatial-Temporal range Aggregation query processing (ESTA) algorithm for UAV networks. First, a topology change graph is constructed based on the pre-planned trajectory information. Meanwhile, an efficient shortest path algorithm is proposed to obtain the user query delay. Then, on the basis of ensuring the user query delay, ESTA transforms the aggregation processing of query results into recursively solving the set cover problem, thereby constructing a spatial-temporal aggregation tree (STAT), based on which an efficient in-network aggregation routing path for query results can be found. Through extensive simulation, we demonstrate that ESTA can save more than 50% of the energy consumption compared with the baseline algorithm.