Secrecy analysis of multiuser downlink wiretap networks with opportunistic scheduling
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ge, Xin | - |
dc.contributor.author | Wu, Peiran | - |
dc.contributor.author | Jin, Hu | - |
dc.contributor.author | Leung, Victor C.M. | - |
dc.date.accessioned | 2021-06-22T21:43:33Z | - |
dc.date.available | 2021-06-22T21:43:33Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2015-06 | - |
dc.identifier.issn | 1550-3607 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/20621 | - |
dc.description.abstract | This paper investigates physical layer security with opportunistic scheduling in a downlink wireless network with multiple asymmetrically located legitimate users (LUs) and eavesdroppers. We employ the cumulative distribution function (CDF)-based scheduling policy to guarantee fairness among LUs in arbitrary fading channels while exploiting multiuser diversity. Under this scheduling framework, the closed-form expressions for the secrecy throughput and secrecy outage probability are derived, illustrating the interplay among the system parameters such as the channel statistics and the number of LUs and eavesdroppers. In order to investigate the exploited multiuser diversity gain, the normalized secrecy throughput, i.e., the secrecy throughput for a given LU normalized by the probability of it being selected, is analyzed and is proved to achieve a double-logarithmic growth when the number of LUs in the network increases to infinity. In addition, we derive the secrecy diversity order through an asymptotic analysis of intercept probability and prove that the secrecy diversity order is equal to the number of LUs in the system, implying that full diversity is achieved by the CDF-based scheduling. © 2015 IEEE. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Secrecy analysis of multiuser downlink wiretap networks with opportunistic scheduling | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jin, Hu | - |
dc.identifier.doi | 10.1109/ICC.2015.7249504 | - |
dc.identifier.scopusid | 2-s2.0-84953731586 | - |
dc.identifier.wosid | 000371708107100 | - |
dc.identifier.bibliographicCitation | IEEE International Conference on Communications, pp.7370 - 7375 | - |
dc.relation.isPartOf | IEEE International Conference on Communications | - |
dc.citation.title | IEEE International Conference on Communications | - |
dc.citation.startPage | 7370 | - |
dc.citation.endPage | 7375 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | CAPACITY | - |
dc.subject.keywordPlus | INFORMATION | - |
dc.subject.keywordPlus | SECURITY | - |
dc.subject.keywordPlus | CHANNELS | - |
dc.subject.keywordAuthor | CDF-based scheduling | - |
dc.subject.keywordAuthor | Multiuser diversity | - |
dc.subject.keywordAuthor | Physical layer security | - |
dc.subject.keywordAuthor | Secrecy outage probability | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7249504 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.