Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/87948
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Li, G | - |
dc.creator | Sheng, X | - |
dc.creator | Wu, J | - |
dc.creator | Yu, H | - |
dc.date.accessioned | 2020-09-04T00:53:04Z | - |
dc.date.available | 2020-09-04T00:53:04Z | - |
dc.identifier.issn | 0743-7315 | - |
dc.identifier.uri | http://hdl.handle.net/10397/87948 | - |
dc.language.iso | en | en_US |
dc.publisher | Academic Press | en_US |
dc.rights | © 2020 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). | en_US |
dc.rights | The following publication Li, G., Sheng, X., Wu, J., & Yu, H. (2020). Securing transmissions by friendly jamming scheme in wireless networks. Journal of Parallel and Distributed Computing. 2020; 144: 260-267, is available at https://doi.org/10.1016/j.jpdc.2020.04.013 | en_US |
dc.subject | Computation complexity | en_US |
dc.subject | CSI of illegitimate nodes | en_US |
dc.subject | Physical layer security | en_US |
dc.subject | Secrecy outage probability | en_US |
dc.title | Securing transmissions by friendly jamming scheme in wireless networks | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 260 | - |
dc.identifier.epage | 267 | - |
dc.identifier.volume | 144 | - |
dc.identifier.doi | 10.1016/j.jpdc.2020.04.013 | - |
dcterms.abstract | In this paper, we focus on the design of optimal relay and jammer selection strategy in relay-aided wireless networks. Different from previous works, assuming that the channel state information (CSI) of illegitimate nodes was available and only an eavesdropper existed, we first analyze disadvantages of joint relay and jammer selection (JRJS), average optimal relay selection (AORS), traditional maximum relay selection (TMRS) schemes. Then, we design an optimal relay and jammer selection strategy where the ratio of received SNRs at the destination generated by any two relays is maximized. By applying proposed strategy, computation complexity can be reduced. Moreover, we derive the lower and upper bounds of the secrecy outage probability based on the assumptions of existence of only illegitimate node and symmetric case for mathematical convenience. Finally, simulation shows that the proposed strategy operating with no CSI of illegitimate nodes can work efficiently compared with JRJS, TMRS and AORS strategies. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of parallel and distributed computing, 2020, v. 144, p.260-267 | - |
dcterms.isPartOf | Journal of parallel and distributed computing | - |
dcterms.issued | 2020 | - |
dc.identifier.scopus | 2-s2.0-85086641820 | - |
dc.description.validate | 202009 bcma | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_Scopus/WOS | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Li_Securing_transmissions_friendly.pdf | 979.63 kB | Adobe PDF | View/Open |
Page views
59
Last Week
0
0
Last month
Citations as of May 12, 2024
Downloads
21
Citations as of May 12, 2024
SCOPUSTM
Citations
6
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
4
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.