Dual-UAV-Enabled Secure Communications: Joint Trajectory Design and User Scheduling

In this paper, we investigate a novel unmanned aerial vehicle (UAV)-enabled secure communication system. Two UAVs are applied in this system where one UAV moves around to communicate with multiple users on the ground using orthogonal time-division multiple access while the other UAV in the area jams...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal on selected areas in communications 2018-09, Vol.36 (9), p.1972-1985
Hauptverfasser: Cai, Yunlong, Cui, Fangyu, Shi, Qingjiang, Zhao, Minjian, Li, Geoffrey Ye
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1985
container_issue 9
container_start_page 1972
container_title IEEE journal on selected areas in communications
container_volume 36
creator Cai, Yunlong
Cui, Fangyu
Shi, Qingjiang
Zhao, Minjian
Li, Geoffrey Ye
description In this paper, we investigate a novel unmanned aerial vehicle (UAV)-enabled secure communication system. Two UAVs are applied in this system where one UAV moves around to communicate with multiple users on the ground using orthogonal time-division multiple access while the other UAV in the area jams the eavesdroppers on the ground to protect communications of the desired users. Specifically, we maximize the minimum worst-case secrecy rate among the users within each period by jointly adjusting UAV trajectories and user scheduling under the maximum UAV speed constraints, the UAV return constraints, the UAV collision avoidance constraints, and the discrete binary constraints on user scheduling variables. Since the resulting optimization problem is very difficult to solve due to its highly nonlinear objective function and nonconvex constraints, we first equivalently transform it into a more tractable problem. In particular, the binary constraints are equivalently converted to a number of equality constraints. Then, we develop a novel joint optimization algorithm to handle the converted problem. In order to further improve the secrecy rate performance, we also extend the developed algorithm to the case with multiple jamming UAVs. The simulation results show that the proposed joint optimization algorithm achieves significantly better performance than the conventional algorithms.
doi_str_mv 10.1109/JSAC.2018.2864424
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2137586462</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8432499</ieee_id><sourcerecordid>2137586462</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-99d0099b5b24994b5fb012de43f82898c11675b2b48054463a4a1ac527fce6413</originalsourceid><addsrcrecordid>eNo9kMtOwzAQRS0EEqXwAYiNJdYpfiY2uyotj6oSi7RsLcdxSqrULnay6N-TqBWrWcy5d0YHgEeMZhgj-bIq5vmMICxmRKSMEXYFJphzkSCExDWYoIzSRGQ4vQV3Me4RwowJMgHFotdtsp1_J0uny9ZWsLCmDxbm_nDoXWN013gXX-HKN66Dm6D31nQ-nODCxmbnoHYV3EYbYGF-bNW3jdvdg5tat9E-XOYUbN-Wm_wjWX-9f-bzdWIol10iZYWQlCUvCZOSlbwuESaVZbQWREhhME6zYVkygThjKdVMY204yWpjU4bpFDyfe4_B__Y2dmrv--CGk4pgmvFBREoGCp8pE3yMwdbqGJqDDieFkRrdqdGdGt2pi7sh83TONNbaf14wOn5K_wAjJ2jW</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2137586462</pqid></control><display><type>article</type><title>Dual-UAV-Enabled Secure Communications: Joint Trajectory Design and User Scheduling</title><source>IEEE Explore</source><creator>Cai, Yunlong ; Cui, Fangyu ; Shi, Qingjiang ; Zhao, Minjian ; Li, Geoffrey Ye</creator><creatorcontrib>Cai, Yunlong ; Cui, Fangyu ; Shi, Qingjiang ; Zhao, Minjian ; Li, Geoffrey Ye</creatorcontrib><description>In this paper, we investigate a novel unmanned aerial vehicle (UAV)-enabled secure communication system. Two UAVs are applied in this system where one UAV moves around to communicate with multiple users on the ground using orthogonal time-division multiple access while the other UAV in the area jams the eavesdroppers on the ground to protect communications of the desired users. Specifically, we maximize the minimum worst-case secrecy rate among the users within each period by jointly adjusting UAV trajectories and user scheduling under the maximum UAV speed constraints, the UAV return constraints, the UAV collision avoidance constraints, and the discrete binary constraints on user scheduling variables. Since the resulting optimization problem is very difficult to solve due to its highly nonlinear objective function and nonconvex constraints, we first equivalently transform it into a more tractable problem. In particular, the binary constraints are equivalently converted to a number of equality constraints. Then, we develop a novel joint optimization algorithm to handle the converted problem. In order to further improve the secrecy rate performance, we also extend the developed algorithm to the case with multiple jamming UAVs. The simulation results show that the proposed joint optimization algorithm achieves significantly better performance than the conventional algorithms.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2018.2864424</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Collision avoidance ; Collision dynamics ; Communications systems ; Computer simulation ; Eavesdropping ; Equivalence ; Heuristic algorithms ; Jamming ; Military technology ; Optimization ; Optimization algorithms ; Scheduling ; secure communications ; Time Division Multiple Access ; Trajectories ; Trajectory ; trajectory optimization ; UAV communications ; Unmanned aerial vehicles</subject><ispartof>IEEE journal on selected areas in communications, 2018-09, Vol.36 (9), p.1972-1985</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-99d0099b5b24994b5fb012de43f82898c11675b2b48054463a4a1ac527fce6413</citedby><cites>FETCH-LOGICAL-c359t-99d0099b5b24994b5fb012de43f82898c11675b2b48054463a4a1ac527fce6413</cites><orcidid>0000-0001-9418-1700 ; 0000-0003-0507-9080</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8432499$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8432499$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cai, Yunlong</creatorcontrib><creatorcontrib>Cui, Fangyu</creatorcontrib><creatorcontrib>Shi, Qingjiang</creatorcontrib><creatorcontrib>Zhao, Minjian</creatorcontrib><creatorcontrib>Li, Geoffrey Ye</creatorcontrib><title>Dual-UAV-Enabled Secure Communications: Joint Trajectory Design and User Scheduling</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>In this paper, we investigate a novel unmanned aerial vehicle (UAV)-enabled secure communication system. Two UAVs are applied in this system where one UAV moves around to communicate with multiple users on the ground using orthogonal time-division multiple access while the other UAV in the area jams the eavesdroppers on the ground to protect communications of the desired users. Specifically, we maximize the minimum worst-case secrecy rate among the users within each period by jointly adjusting UAV trajectories and user scheduling under the maximum UAV speed constraints, the UAV return constraints, the UAV collision avoidance constraints, and the discrete binary constraints on user scheduling variables. Since the resulting optimization problem is very difficult to solve due to its highly nonlinear objective function and nonconvex constraints, we first equivalently transform it into a more tractable problem. In particular, the binary constraints are equivalently converted to a number of equality constraints. Then, we develop a novel joint optimization algorithm to handle the converted problem. In order to further improve the secrecy rate performance, we also extend the developed algorithm to the case with multiple jamming UAVs. The simulation results show that the proposed joint optimization algorithm achieves significantly better performance than the conventional algorithms.</description><subject>Algorithms</subject><subject>Collision avoidance</subject><subject>Collision dynamics</subject><subject>Communications systems</subject><subject>Computer simulation</subject><subject>Eavesdropping</subject><subject>Equivalence</subject><subject>Heuristic algorithms</subject><subject>Jamming</subject><subject>Military technology</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Scheduling</subject><subject>secure communications</subject><subject>Time Division Multiple Access</subject><subject>Trajectories</subject><subject>Trajectory</subject><subject>trajectory optimization</subject><subject>UAV communications</subject><subject>Unmanned aerial vehicles</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMtOwzAQRS0EEqXwAYiNJdYpfiY2uyotj6oSi7RsLcdxSqrULnay6N-TqBWrWcy5d0YHgEeMZhgj-bIq5vmMICxmRKSMEXYFJphzkSCExDWYoIzSRGQ4vQV3Me4RwowJMgHFotdtsp1_J0uny9ZWsLCmDxbm_nDoXWN013gXX-HKN66Dm6D31nQ-nODCxmbnoHYV3EYbYGF-bNW3jdvdg5tat9E-XOYUbN-Wm_wjWX-9f-bzdWIol10iZYWQlCUvCZOSlbwuESaVZbQWREhhME6zYVkygThjKdVMY204yWpjU4bpFDyfe4_B__Y2dmrv--CGk4pgmvFBREoGCp8pE3yMwdbqGJqDDieFkRrdqdGdGt2pi7sh83TONNbaf14wOn5K_wAjJ2jW</recordid><startdate>20180901</startdate><enddate>20180901</enddate><creator>Cai, Yunlong</creator><creator>Cui, Fangyu</creator><creator>Shi, Qingjiang</creator><creator>Zhao, Minjian</creator><creator>Li, Geoffrey Ye</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-9418-1700</orcidid><orcidid>https://orcid.org/0000-0003-0507-9080</orcidid></search><sort><creationdate>20180901</creationdate><title>Dual-UAV-Enabled Secure Communications: Joint Trajectory Design and User Scheduling</title><author>Cai, Yunlong ; Cui, Fangyu ; Shi, Qingjiang ; Zhao, Minjian ; Li, Geoffrey Ye</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-99d0099b5b24994b5fb012de43f82898c11675b2b48054463a4a1ac527fce6413</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Collision avoidance</topic><topic>Collision dynamics</topic><topic>Communications systems</topic><topic>Computer simulation</topic><topic>Eavesdropping</topic><topic>Equivalence</topic><topic>Heuristic algorithms</topic><topic>Jamming</topic><topic>Military technology</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Scheduling</topic><topic>secure communications</topic><topic>Time Division Multiple Access</topic><topic>Trajectories</topic><topic>Trajectory</topic><topic>trajectory optimization</topic><topic>UAV communications</topic><topic>Unmanned aerial vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cai, Yunlong</creatorcontrib><creatorcontrib>Cui, Fangyu</creatorcontrib><creatorcontrib>Shi, Qingjiang</creatorcontrib><creatorcontrib>Zhao, Minjian</creatorcontrib><creatorcontrib>Li, Geoffrey Ye</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Explore</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cai, Yunlong</au><au>Cui, Fangyu</au><au>Shi, Qingjiang</au><au>Zhao, Minjian</au><au>Li, Geoffrey Ye</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dual-UAV-Enabled Secure Communications: Joint Trajectory Design and User Scheduling</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2018-09-01</date><risdate>2018</risdate><volume>36</volume><issue>9</issue><spage>1972</spage><epage>1985</epage><pages>1972-1985</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>In this paper, we investigate a novel unmanned aerial vehicle (UAV)-enabled secure communication system. Two UAVs are applied in this system where one UAV moves around to communicate with multiple users on the ground using orthogonal time-division multiple access while the other UAV in the area jams the eavesdroppers on the ground to protect communications of the desired users. Specifically, we maximize the minimum worst-case secrecy rate among the users within each period by jointly adjusting UAV trajectories and user scheduling under the maximum UAV speed constraints, the UAV return constraints, the UAV collision avoidance constraints, and the discrete binary constraints on user scheduling variables. Since the resulting optimization problem is very difficult to solve due to its highly nonlinear objective function and nonconvex constraints, we first equivalently transform it into a more tractable problem. In particular, the binary constraints are equivalently converted to a number of equality constraints. Then, we develop a novel joint optimization algorithm to handle the converted problem. In order to further improve the secrecy rate performance, we also extend the developed algorithm to the case with multiple jamming UAVs. The simulation results show that the proposed joint optimization algorithm achieves significantly better performance than the conventional algorithms.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2018.2864424</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0001-9418-1700</orcidid><orcidid>https://orcid.org/0000-0003-0507-9080</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0733-8716
ispartof IEEE journal on selected areas in communications, 2018-09, Vol.36 (9), p.1972-1985
issn 0733-8716
1558-0008
language eng
recordid cdi_proquest_journals_2137586462
source IEEE Explore
subjects Algorithms
Collision avoidance
Collision dynamics
Communications systems
Computer simulation
Eavesdropping
Equivalence
Heuristic algorithms
Jamming
Military technology
Optimization
Optimization algorithms
Scheduling
secure communications
Time Division Multiple Access
Trajectories
Trajectory
trajectory optimization
UAV communications
Unmanned aerial vehicles
title Dual-UAV-Enabled Secure Communications: Joint Trajectory Design and User Scheduling
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T19%3A42%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dual-UAV-Enabled%20Secure%20Communications:%20Joint%20Trajectory%20Design%20and%20User%20Scheduling&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Cai,%20Yunlong&rft.date=2018-09-01&rft.volume=36&rft.issue=9&rft.spage=1972&rft.epage=1985&rft.pages=1972-1985&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2018.2864424&rft_dat=%3Cproquest_RIE%3E2137586462%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2137586462&rft_id=info:pmid/&rft_ieee_id=8432499&rfr_iscdi=true