Asymptotically optimal cooperative jamming for physical layer security

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Asymptotically optimal cooperative jamming for physical layer security. / Yang, Jun; Salari, Soheil; Kim, Il Min; Kim, Dong In; Kim, Seokki; Lim, Kwangae.

In: Journal of Communications and Networks, Vol. 18, No. 1, 000011, 02.2016, p. 84-94.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Yang, J, Salari, S, Kim, IM, Kim, DI, Kim, S & Lim, K 2016, 'Asymptotically optimal cooperative jamming for physical layer security', Journal of Communications and Networks, vol. 18, no. 1, 000011, pp. 84-94. https://doi.org/10.1109/JCN.2016.000011

APA

Yang, J., Salari, S., Kim, I. M., Kim, D. I., Kim, S., & Lim, K. (2016). Asymptotically optimal cooperative jamming for physical layer security. Journal of Communications and Networks, 18(1), 84-94. [000011]. https://doi.org/10.1109/JCN.2016.000011

Vancouver

Yang J, Salari S, Kim IM, Kim DI, Kim S, Lim K. Asymptotically optimal cooperative jamming for physical layer security. Journal of Communications and Networks. 2016 Feb;18(1):84-94. 000011. https://doi.org/10.1109/JCN.2016.000011

Author

Yang, Jun ; Salari, Soheil ; Kim, Il Min ; Kim, Dong In ; Kim, Seokki ; Lim, Kwangae. / Asymptotically optimal cooperative jamming for physical layer security. In: Journal of Communications and Networks. 2016 ; Vol. 18, No. 1. pp. 84-94.

Bibtex

@article{56604c67a477472690da6afd44d7f452,

title = "Asymptotically optimal cooperative jamming for physical layer security",

abstract = "Design of effective cooperative jamming (CJ) algorithm is studied in this paper to maximize the achievable secrecy rate when the total transmit power of the source and multiple trusted terminals is constrained. Recently, the same problem was studied in [1] and an optimal algorithm was proposed involving a one-dimensional exhaustive searching.However, the computational complexity of such exhaustive searching could be very high, which may limit the practical use of the optimal algorithm. We propose an asymptotically optimal algorithm, involving only a fast line searching, which can guarantee to achieve the global optimality when the total transmit power goes to infinity. Numerical results demonstrate that the proposed asymptotically optimal algorithm essentially gives the same performance as the algorithm in [1, (44)] but with much lower computational complexity.",

keywords = "Cooperative jamming, Physical layer security, Secrecy rate",

author = "Jun Yang and Soheil Salari and Kim, {Il Min} and Kim, {Dong In} and Seokki Kim and Kwangae Lim",

note = "Publisher Copyright: {\textcopyright} 2016 KICS.",

year = "2016",

month = feb,

doi = "10.1109/JCN.2016.000011",

language = "English",

volume = "18",

pages = "84--94",

journal = "Journal of Communications and Networks",

issn = "1229-2370",

publisher = "Cornell University Library",

number = "1",

}

RIS

TY - JOUR

T1 - Asymptotically optimal cooperative jamming for physical layer security

AU - Yang, Jun

AU - Salari, Soheil

AU - Kim, Il Min

AU - Kim, Dong In

AU - Kim, Seokki

AU - Lim, Kwangae

PY - 2016/2

Y1 - 2016/2

N2 - Design of effective cooperative jamming (CJ) algorithm is studied in this paper to maximize the achievable secrecy rate when the total transmit power of the source and multiple trusted terminals is constrained. Recently, the same problem was studied in [1] and an optimal algorithm was proposed involving a one-dimensional exhaustive searching.However, the computational complexity of such exhaustive searching could be very high, which may limit the practical use of the optimal algorithm. We propose an asymptotically optimal algorithm, involving only a fast line searching, which can guarantee to achieve the global optimality when the total transmit power goes to infinity. Numerical results demonstrate that the proposed asymptotically optimal algorithm essentially gives the same performance as the algorithm in [1, (44)] but with much lower computational complexity.

AB - Design of effective cooperative jamming (CJ) algorithm is studied in this paper to maximize the achievable secrecy rate when the total transmit power of the source and multiple trusted terminals is constrained. Recently, the same problem was studied in [1] and an optimal algorithm was proposed involving a one-dimensional exhaustive searching.However, the computational complexity of such exhaustive searching could be very high, which may limit the practical use of the optimal algorithm. We propose an asymptotically optimal algorithm, involving only a fast line searching, which can guarantee to achieve the global optimality when the total transmit power goes to infinity. Numerical results demonstrate that the proposed asymptotically optimal algorithm essentially gives the same performance as the algorithm in [1, (44)] but with much lower computational complexity.

KW - Cooperative jamming

KW - Physical layer security

KW - Secrecy rate

UR - http://www.scopus.com/inward/record.url?scp=84963799608&partnerID=8YFLogxK

U2 - 10.1109/JCN.2016.000011

DO - 10.1109/JCN.2016.000011

M3 - Journal article

AN - SCOPUS:84963799608

VL - 18

SP - 84

EP - 94

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 1

M1 - 000011

ER -

ID: 362746802