The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Esta carta estuda projeto de transmissão segura com entrada alfabética finita para redes de interferência cooperativa sob restrição de energia individual. Ao adotar o esquema de força zero, onde o sinal de interferência é totalmente colocado no espaço nulo do canal de destino do relé, o problema de aumentar a taxa de sigilo alcançável é decomposto em dois subproblemas independentes: projeto de pesos de relé e controle de potência. Revelamos que o problema de projeto de pesos de relé é idêntico ao problema de minimização do ganho máximo equivalente do canal fonte-escuta, que pode ser transformado em um problema de programação semidefinida (SDP) e, portanto, é resolvido usando o método de ponto interior. Além disso, o problema de controle de potência é resolvido com a relação fundamental entre informação mútua e erro quadrático médio mínimo (MMSE). Os resultados numéricos mostram que o esquema proposto alcança ganhos significativos de desempenho em comparação com o projeto gaussiano convencional.
Kuo CAO
PLA Army Engineering University
Yueming CAI
PLA Army Engineering University
Yongpeng WU
Shanghai Jiao Tong University, China
Weiwei YANG
PLA Army Engineering University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Kuo CAO, Yueming CAI, Yongpeng WU, Weiwei YANG, "Cooperative Jamming for Secure Transmission with Finite Alphabet Input under Individual Power Constraint" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 6, pp. 961-966, June 2018, doi: 10.1587/transfun.E101.A.961.
Abstract: This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.961/_p
Copiar
@ARTICLE{e101-a_6_961,
author={Kuo CAO, Yueming CAI, Yongpeng WU, Weiwei YANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cooperative Jamming for Secure Transmission with Finite Alphabet Input under Individual Power Constraint},
year={2018},
volume={E101-A},
number={6},
pages={961-966},
abstract={This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.},
keywords={},
doi={10.1587/transfun.E101.A.961},
ISSN={1745-1337},
month={June},}
Copiar
TY - JOUR
TI - Cooperative Jamming for Secure Transmission with Finite Alphabet Input under Individual Power Constraint
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 961
EP - 966
AU - Kuo CAO
AU - Yueming CAI
AU - Yongpeng WU
AU - Weiwei YANG
PY - 2018
DO - 10.1587/transfun.E101.A.961
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2018
AB - This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
ER -