Abstract
This work considers unmanned aerial vehicle (UAV) networks for collecting data covertly from ground users. The full-duplex UAV intends to gather critical information from a scheduled user (SU) through wireless communication and generate artificial noise (AN) with random transmit power in order to ensure a negligible probability of the SU's transmission being detected by the unscheduled users (USUs). To enhance the system performance, we jointly design the UAV's trajectory and its maximum AN transmit power together with the user scheduling strategy subject to practical constraints, e.g., a covertness constraint, which is explicitly determined by analyzing each USU's detection performance, and a binary constraint induced by user scheduling. The formulated design problem is a mixed-integer non-convex optimization problem, which is challenging to solve directly, but solved by a penalty successive convex approximation (P-SCA) scheme. Our examination shows that the P-SCA scheme significantly outperforms a benchmark scheme in terms of achieving a higher max-min average transmission rate subject to the same covertness constraint.
Original language | English |
---|---|
Title of host publication | 2019 IEEE Globecom Workshops (GC Wkshps) |
Subtitle of host publication | proceedings |
Place of Publication | Piscataway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 1-6 |
Number of pages | 6 |
ISBN (Electronic) | 9781728109602 |
ISBN (Print) | 9781728109619 |
DOIs | |
Publication status | Published - 2019 |
Event | 2019 IEEE Globecom Workshops (GC Wkshps) - Waikoloa, United States Duration: 9 Dec 2019 → 13 Dec 2019 |
Conference
Conference | 2019 IEEE Globecom Workshops (GC Wkshps) |
---|---|
Abbreviated title | GC Wkshps |
Country/Territory | United States |
City | Waikoloa |
Period | 9/12/19 → 13/12/19 |