IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v12y2020i11p193-d441902.html
   My bibliography  Save this article

High Throughput Data Relay in UAV Wireless Networks

Author

Listed:
  • Fenyu Jiang

    (School of Electronic Engineering and Computer Science, Queen Mary University of London, London E1 4NS, UK)

  • Chris Phillips

    (School of Electronic Engineering and Computer Science, Queen Mary University of London, London E1 4NS, UK)

Abstract

As a result of their high mobility and reduced cost, Unmanned Aerial Vehicles (UAVs) have been found to be a promising tool in wireless networks. A UAV can perform the role of a base station as well as a mobile relay, connecting distant ground terminals. In this paper, we dispatch a UAV to a disaster area to help relay information for victims. We involve a bandwidth efficient technique called the Dual-Sampling (DS) method when planning the UAV flight trajectory, trying to maximize the data transmission throughput. We propose an iterative algorithm for solving this problem. The victim bandwidth scheduling and the UAV trajectory are alternately optimized in each iteration, meanwhile a power balance mechanism is implemented in the algorithm to ensure the proper functioning of the DS method. We compare the results of the DS-enabled scheme with two non-DS schemes, namely a fair bandwidth allocation scheme and a bandwidth contention scheme. The DS scheme outperforms the other two non-DS schemes regarding max-min average data rate among all the ground victims. Furthermore, we derive the theoretical optimal performance of the DS scheme for a given scenario, and find that the proposed approach can be regarded as a general method to solve this optimization problem. We also observe that the optimal UAV trajectory for the DS scheme is quite different from that of the non-DS bandwidth contention scheme.

Suggested Citation

  • Fenyu Jiang & Chris Phillips, 2020. "High Throughput Data Relay in UAV Wireless Networks," Future Internet, MDPI, vol. 12(11), pages 1-14, November.
  • Handle: RePEc:gam:jftint:v:12:y:2020:i:11:p:193-:d:441902
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/12/11/193/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/12/11/193/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:12:y:2020:i:11:p:193-:d:441902. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.