• Login
    View Item 
    •   Home
    • UA Faculty Research
    • UA Faculty Publications
    • View Item
    •   Home
    • UA Faculty Research
    • UA Faculty Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Average Worst-Case Secrecy Rate Maximization via UAV and Base Station Resource Allocation

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    manuscript_SA_09273019.pdf
    Size:
    265.3Kb
    Format:
    PDF
    Description:
    Final Accepted Manuscript
    Download
    Author
    Ahmed, Shakil
    Bash, Boulat A.
    Affiliation
    Univ Arizona, Dept Elect & Comp Engn
    Issue Date
    2019-09
    Keywords
    resource allocation
    average worst-case secrecy rate
    information causality constraint
    adversary
    UAV
    BS
    
    Metadata
    Show full item record
    Publisher
    IEEE
    Citation
    S. Ahmed and B. A. Bash, "Average Worst-Case Secrecy Rate Maximization via UAV and Base Station Resource Allocation," 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 2019, pp. 1176-1181, doi: 10.1109/ALLERTON.2019.8919955.
    Journal
    2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)
    Rights
    © 2019 IEEE.
    Collection Information
    This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.
    Abstract
    In this paper, we consider a wireless network setting where a base station (BS) employs a single unmanned aerial vehicle (UAV) mobile relay to disseminate information to multiple users in the presence of multiple adversaries. The BS, which is on the ground, has no direct link to the users or the adversaries, who are also on the ground. We optimize the joint transmit power of the BS and the UAV, and the UAV trajectory. We introduce the information causality constraint and maximize the average worst-case secrecy rate in the presence of the adversaries. The formulated average worst-case secrecy rate optimization problem is not convex and is solved sub-optimally. First, we optimize the transmit power of the BS and the UAV under a given UAV trajectory. Then, we optimize the UAV trajectory under the sub-optimal UAV and BS transmit power. An efficient algorithm solves the average worst-case secrecy rate maximization problem iteratively until it converges. Finally, simulation results are provided, which demonstrate the correspondence of the UAV optimal track and transmit power allocation to what is suggested by the previous theoretic results.
    ISSN
    2474-0195
    DOI
    10.1109/allerton.2019.8919955
    Version
    Final accepted manuscript
    ae974a485f413a2113503eed53cd6c53
    10.1109/allerton.2019.8919955
    Scopus Count
    Collections
    UA Faculty Publications

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.