Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Dual-UAV enabled secure data collection with propulsion limitation

Tools
- Tools
+ Tools

Zhang, R., Pang, W., Lu, N., Chen, Yunfei and Niyato, D. (2021) Dual-UAV enabled secure data collection with propulsion limitation. IEEE Transactions on Wireless Communications, 20 (11). pp. 7445-7459. doi:10.1109/TWC.2021.3084140 ISSN 1536-1276.

[img]
Preview
PDF
WRAP-dual-UAV-enabled-secure-data-collection-propulsion-limitation-Chen-2021.pdf - Accepted Version - Requires a PDF viewer.

Download (6Mb) | Preview
Official URL: https://doi.org/10.1109/TWC.2021.3084140

Request Changes to record.

Abstract

Unmanned aerial vehicles (UAVs) have been widely utilized to improve the end-to-end performance of wireless communications. However, its line-of-sight makes UAV communication vulnerable to malicious eavesdroppers. In this paper, we propose two cooperative dual-UAV enabled secure data collection schemes to ensure security, with the practical propulsion energy consumption considered. We first maximize the worst-case average secrecy rate with the average propulsion power limitation, where the scheduling, the transmit power, the trajectory and the velocity of the two UAVs are jointly optimized. To solve the non-convex multivariable problem, we propose an iterative algorithm based on block coordinate descent and successive convex approximation. To further save the on-board energy and prolong the flight time, we then maximize the secrecy energy efficiency of UAV data collection, which is a fractional and mixed integer nonlinear programming problem. Based on the Dinkelbach method, we transform the objective function into an integral expression and propose an iterative algorithm to obtain a suboptimal solution to secrecy energy efficiency maximization. Numerical results show that the average secrecy rate is maximized in the first scheme with propulsion limitation, while in the second scheme, the secrecy energy efficiency is maximized with the optimal velocity to save propulsion power and improve secrecy rate simultaneously.

Item Type: Journal Article
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
T Technology > TL Motor vehicles. Aeronautics. Astronautics
Divisions: Faculty of Science, Engineering and Medicine > Engineering > Engineering
Library of Congress Subject Headings (LCSH): Drone aircraft , Wireless communication systems, Wireless communication systems -- Security measures, Propulsion systems
Journal or Publication Title: IEEE Transactions on Wireless Communications
Publisher: IEEE
ISSN: 1536-1276
Official Date: November 2021
Dates:
DateEvent
November 2021Published
4 June 2021Available
23 May 2021Accepted
Volume: 20
Number: 11
Page Range: pp. 7445-7459
DOI: 10.1109/TWC.2021.3084140
Status: Peer Reviewed
Publication Status: Published
Reuse Statement (publisher, data, author rights): © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 26 May 2021
Date of first compliant Open Access: 26 May 2021
Related URLs:
  • Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us