Secure communication design for multi-user peer-to-peer wireless relay networks

In this study, physical layer security techniques are studied for multi-user peer-to-peer relay networks using amplify-and-forward protocol in the presence of an eavesdropper. Two system designs are considered: the minimum achievable secrecy rate maximisation and the total transmit power minimisatio...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IET communications Jg. 10; H. 7; S. 770 - 777
Hauptverfasser:	Gong, Xiangwu, Long, Hang, Dong, Feihong, Yin, Hao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	The Institution of Engineering and Technology 05.05.2016
Schlagworte:	Algorithms amplify and forward communication amplify‐and‐forward protocol computer network security concave programming convex problem convex programming Design engineering gradient methods gradient‐based algorithm mathematical analysis max‐min achievable secrecy rate problem minimax techniques minimisation multiuser peer‐to‐peer wireless relay network nonconvex optimisation problem nonlinear optimisation problem nonlinear programming numerical evaluation Optimization peer‐to‐peer computing physical layer security technique polynomial time algorithm Polynomials power minimisation problem protocols radio networks relaxation technique relaxation theory Relay networks relay networks (telecommunication) secrecy rate maximisation secure wireless communication design Social networks Systems design total power optimisation problem Wireless communication radio networks nonlinear programming secrecy rate maximisation amplify-and-forward protocol minimax techniques amplify and forward communication power minimisation problem nonconvex optimisation problem relaxation technique physical layer security technique total power optimisation problem gradient-based algorithm relaxation theory protocols gradient methods concave programming relay networks (telecommunication) multiuser peer-to-peer wireless relay network peer-to-peer computing polynomials max-min achievable secrecy rate problem convex programming mathematical analysis secure wireless communication design polynomial time algorithm computer network security nonlinear optimisation problem convex problem numerical evaluation minimisation
ISSN:	1751-8628, 1751-8636
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!