Opportunistic fair resource sharing with secrecy considerations in uplink wiretap channels
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ge, Xin | - |
dc.contributor.author | Jin, Hu | - |
dc.contributor.author | Li, Xiuhua | - |
dc.contributor.author | Leung, Voctor C. M. | - |
dc.date.accessioned | 2021-06-22T21:42:14Z | - |
dc.date.available | 2021-06-22T21:42:14Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2015-03 | - |
dc.identifier.issn | 1525-3511 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/20569 | - |
dc.description.abstract | In this paper, we propose two opportunistic scheduling algorithms for uplink wiretap networks with multiple legitimate users (LUs) and eavesdroppers. Different from the existing works on scheduling algorithms with secrecy considerations, we focus on the practical scenario where LUs experience diverse path-loss to the base station (BS). Hence, both secrecy throughput and fairness among LUs are crucial design considerations. In the proposed scheduling algorithms, the feedback information generated by each LU is designed to reduce the probability that the LU is selected by the BS when the eavesdroppers overhear much information. It is proved that fairness among LUs can be achieved in arbitrary fading channels. In order to investigate the efficiency of our proposed scheduling algorithms, the normalized secrecy throughput, i.e., the secrecy throughput for a given LU normalized by the probability of it being selected, is analyzed and proved to achieve double-logarithmic growth when the number of LUs in the network increases to infinity. © 2015 IEEE. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Opportunistic fair resource sharing with secrecy considerations in uplink wiretap channels | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jin, Hu | - |
dc.identifier.doi | 10.1109/WCNC.2015.7127677 | - |
dc.identifier.scopusid | 2-s2.0-84938703488 | - |
dc.identifier.wosid | 000380909600243 | - |
dc.identifier.bibliographicCitation | 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015, pp.1422 - 1427 | - |
dc.relation.isPartOf | 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 | - |
dc.citation.title | 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 | - |
dc.citation.startPage | 1422 | - |
dc.citation.endPage | 1427 | - |
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 | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Fading channels | - |
dc.subject.keywordPlus | Network layers | - |
dc.subject.keywordPlus | Scheduling | - |
dc.subject.keywordPlus | Throughput | - |
dc.subject.keywordPlus | Wireless telecommunication systems | - |
dc.subject.keywordPlus | Design considerations | - |
dc.subject.keywordPlus | Feed back information | - |
dc.subject.keywordPlus | Logarithmic growth | - |
dc.subject.keywordPlus | Opportunistic scheduling | - |
dc.subject.keywordPlus | Physical layer security | - |
dc.subject.keywordPlus | Resource sharing | - |
dc.subject.keywordPlus | User scheduling | - |
dc.subject.keywordPlus | Wire-tap channels | - |
dc.subject.keywordPlus | Scheduling algorithms | - |
dc.subject.keywordAuthor | fair resource sharing | - |
dc.subject.keywordAuthor | Physical layer security | - |
dc.subject.keywordAuthor | throughput scaling | - |
dc.subject.keywordAuthor | user scheduling | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7127677 | - |
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.