Literature Database Entry

khalili2023energy-aware

Ata Khalili, Atefeh Rezaei, Dongfang Xu and Robert Schober, "Energy-Aware Resource Allocation and Trajectory Design for UAV-Enabled ISAC," Proceedings of IEEE Global Communications Conference (GLOBECOM 2023), Kuala Lumpur, Malaysia, December 2023, pp. 4200–4205.

Abstract

In this paper, we investigate joint resource allocation and trajectory design for multi-user multi-target unmanned aerial vehicle (UAV)-enabled integrated sensing and communication (ISAC). To be compatible with practical UAV-based sensing systems, sensing is carried out while the UAV hovers. In particular, we jointly optimize the two-dimensional trajectory, the velocity, and the downlink information and sensing beamformers of a fixed-altitude UAV for minimization of the average power consumption, while ensuring the quality of service of the communication users and the sensing tasks. To tackle the resulting non-convex mixed integer non-linear program (MINLP), we exploit semidefinite relaxation, the big-M method, and successive convex approximation to develop an alternating optimization-based algorithm. Our simulation results demonstrate the significant power savings enabled by the proposed scheme compared to two baseline schemes employing heuristic trajectories.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Ata Khalili
Atefeh Rezaei
Dongfang Xu
Robert Schober

BibTeX reference

@inproceedings{khalili2023energy-aware,
    author = {Khalili, Ata and Rezaei, Atefeh and Xu, Dongfang and Schober, Robert},
    doi = {10.1109/GLOBECOM54140.2023.10437374},
    title = {{Energy-Aware Resource Allocation and Trajectory Design for UAV-Enabled ISAC}},
    pages = {4200--4205},
    publisher = {IEEE},
    address = {Kuala Lumpur, Malaysia},
    booktitle = {IEEE Global Communications Conference (GLOBECOM 2023)},
    month = {12},
    year = {2023},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.