We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Resource-Efficient Seamless Transitions For High-Performance Multi-hop UAV Multicasting

Tu, Wanqing (2022) 'Resource-Efficient Seamless Transitions For High-Performance Multi-hop UAV Multicasting.', Computer Networks, 213 . p. 109051.


Many UAV-related applications require group communications between UAVs to reliably and efficiently deliver rich media content as well as to extend line-of-sight coverage between sky and ground. This paper is among the first to study fast yet resource-efficient UAV transitions for aerial group communications while maintaining high group communication performance. We develop a set of novel analytic and algorithmic results to form the efficient transition formation (ETF) algorithm, in order to deal with different UAV transition scenarios in a group communication environment. The ETF algorithm first evaluates the seamlessness of a straight-line trajectory (SLT) by processing low-complexity computations (e.g., Euclidean distances) or fast checks with controlled traffic overheads. For a non-seamless SLT, the ETF algorithmm establishes a new trajectory consisting of a minimal number of seamless straight lines that join at specially selected locations to control mobile UAVs’ seamless travel distances. Our simulation studies quantify the performance gains that the ETF algorithm may achieve, outperforming compared studies by admitting 66% more traffic with reduced energy consumption and guaranteed communication performance for both transitional and non-transitional UAVs.

Item Type:Article
Full text:Publisher-imposed embargo until 22 June 2023.
(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives 4.0.
File format - PDF
Publisher Web site:
Publisher statement:© 2022. This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Date accepted:15 May 2022
Date deposited:17 May 2022
Date of first online publication:23 May 2022
Date first made open access:22 June 2023

Save or Share this output

Look up in GoogleScholar