UAV-Enabled Covert Wireless Data Collection

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 en...

Full description

Saved in:
Bibliographic Details
Main Authors Zhou, Xiaobo, Yan, Shihao, Shu, Feng, Chen, Riqing, Li, Jun
Format Journal Article
LanguageEnglish
Published 20.06.2019
Online AccessGet full text
DOI10.48550/arxiv.1906.08438

Cover

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 tackled by our developed penalty successive convex approximation (P-SCA) scheme. An efficient UAV trajectory initialization is also presented based on the Successive Hover-and-Fly (SHAF) trajectory, which also serves as a benchmark scheme. Our examination shows the developed P-SCA scheme significantly outperforms the benchmark scheme in terms of achieving a higher max-min average transmission rate from all the SUs to the UAV.
AbstractList 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 tackled by our developed penalty successive convex approximation (P-SCA) scheme. An efficient UAV trajectory initialization is also presented based on the Successive Hover-and-Fly (SHAF) trajectory, which also serves as a benchmark scheme. Our examination shows the developed P-SCA scheme significantly outperforms the benchmark scheme in terms of achieving a higher max-min average transmission rate from all the SUs to the UAV.
Author Shu, Feng
Li, Jun
Zhou, Xiaobo
Chen, Riqing
Yan, Shihao
Author_xml – sequence: 1
  givenname: Xiaobo
  surname: Zhou
  fullname: Zhou, Xiaobo
– sequence: 2
  givenname: Shihao
  surname: Yan
  fullname: Yan, Shihao
– sequence: 3
  givenname: Feng
  surname: Shu
  fullname: Shu, Feng
– sequence: 4
  givenname: Riqing
  surname: Chen
  fullname: Chen, Riqing
– sequence: 5
  givenname: Jun
  surname: Li
  fullname: Li, Jun
BackLink https://doi.org/10.48550/arXiv.1906.08438$$DView paper in arXiv
BookMark eNrjYmDJy89LZWCQNDTQM7EwNTXQTyyqyCzTM7Q0MNMzsDAxtuBk0A51DNN1zUtMyklNUXDOL0stKlEIzyxKzUktLlZwSSxJBArm5KQml2Tm5_EwsKYl5hSn8kJpbgZ5N9cQZw9dsLHxBUWZuYlFlfEg4-PBxhsTVgEABZAwHQ
ContentType Journal Article
Copyright http://arxiv.org/licenses/nonexclusive-distrib/1.0
Copyright_xml – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0
DBID GOX
DOI 10.48550/arxiv.1906.08438
DatabaseName arXiv.org
DatabaseTitleList
Database_xml – sequence: 1
  dbid: GOX
  name: arXiv.org
  url: http://arxiv.org/find
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 1906_08438
GroupedDBID GOX
ID FETCH-arxiv_primary_1906_084383
IEDL.DBID GOX
IngestDate Tue Jul 22 23:09:56 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-arxiv_primary_1906_084383
OpenAccessLink https://arxiv.org/abs/1906.08438
ParticipantIDs arxiv_primary_1906_08438
PublicationCentury 2000
PublicationDate 2019-06-20
PublicationDateYYYYMMDD 2019-06-20
PublicationDate_xml – month: 06
  year: 2019
  text: 2019-06-20
  day: 20
PublicationDecade 2010
PublicationYear 2019
Score 3.3860002
SecondaryResourceType preprint
Snippet This work considers unmanned aerial vehicle (UAV) networks for collecting data covertly from ground users. The full-duplex UAV intends to gather critical...
SourceID arxiv
SourceType Open Access Repository
Title UAV-Enabled Covert Wireless Data Collection
URI https://arxiv.org/abs/1906.08438
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdVzBSgMxEB3annopipaqVXPwJtHdbjZNj6W2FkG9tGVvSxInUBCRupV-vpPZil56TYYZSELePGbmAdwgJjmaTEnEYKVy2ktLuCFdiioE1KnncsHzi54v1VORFw0Qv7MwdrNbf9f6wO7rntBK3yVGZaYJzcEgkqvH16IuTrIU197-z45yTF76BxKzI-jsszsxrq_jGBr4cQK3y_FKTnlG6U1MYstkJWLT6Tt9MuLBVlYwe-cBg1O4nk0Xk7lk9-VnrQVRxsglR8660CLGjj0QmAdtnPe5HqEahqHRJlHOh9QRG_F6dAa9Q17OD29dQJvQOmoG0NPuQ6vabPGSELFyV3wsP02sZO4
linkProvider Cornell University
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=UAV-Enabled+Covert+Wireless+Data+Collection&rft.au=Zhou%2C+Xiaobo&rft.au=Yan%2C+Shihao&rft.au=Shu%2C+Feng&rft.au=Chen%2C+Riqing&rft.date=2019-06-20&rft_id=info:doi/10.48550%2Farxiv.1906.08438&rft.externalDocID=1906_08438