2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDSPCOM-2.3
Paper Title SECURE UAV COMMUNICATIONS UNDER UNCERTAIN EAVESDROPPERS LOCATIONS
Authors Silei Wang, Fanxiang Kong, Qiang Li, University of Electronic Science and Technology of China, China
SessionSPCOM-2: Information Theory, Coding and Security
LocationGather.Town
Session Time:Tuesday, 08 June, 16:30 - 17:15
Presentation Time:Tuesday, 08 June, 16:30 - 17:15
Presentation Poster
Topic Signal Processing for Communications and Networking: [CIT-PHYS] Physical Layer Security
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract Benefiting from the merits of low cost and high mobility, Unmanned aerial vehicle (UAV) enabled communications have recently drawn considerable attentions. In this paper, we consider the UAV-enabled physical-layer secure communications. Specifically, we consider a UAV-ground communication systems with multiple eavesdroppers whose locations are not perfectly known and are assumed to follow Gaussian distribution. An outage probability-constrained average secrecy rate maximization (ASRM) problem is formulated by jointly optimizing the trajectory and the transmit power of the UAV over a given flight duration. The ASRM problem is challenging due to the probabilistic constraints. To circumvent the difficulty, we employ a safe approximation approach and the successive convex optimization method to find a tractable solution to the ASRM problem. The effectiveness and robustness of the proposed design are demonstrated through simulations.