Asymptotically optimal cooperative jamming for physical layer security
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
Asymptotically optimal cooperative jamming for physical layer security. / Yang, Jun; Salari, Soheil; Kim, Il Min; Kim, Dong In; Kim, Seokki; Lim, Kwangae.
I: Journal of Communications and Networks, Bind 18, Nr. 1, 000011, 02.2016, s. 84-94.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
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
N1 - Publisher Copyright: © 2016 KICS.
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