Paper Info
Title
Optimal power allocation for achieving perfect secrecy capacity in MIMO wire-tap channels
Abstract
In this paper, we investigate optimal power allocation to achieve perfect secrecy capacity in Gaussian MIMO wire-tap channels. The number of antennas in the MIMO wire-tap channel is arbitrary at the transmitter, the intended receiver, and the eavesdropper. For this challenging non-convex optimization problem, we design a novel global optimization algorithm called branch-and-bound with reformulation and linearization technique (BB/RLT). As opposed to convex programming methods that only yield local optimal solutions, our proposed BB/RLT method guarantees finding a global optimal solution. The main contribution in this paper is that our proposed BB/RLT algorithm is the first method that solves the optimal power allocation problem for achieving perfect secrecy capacity problem in MIMO wire-tap channels. Numerical examples are also given to demonstrate the efficacy of the proposed algorithm.
Year
DOI
Venue
2009
10.1109/CISS.2009.5054790
CISS
Keywords
Field
DocType
optimisation,gaussian channels,global optimization algorithm,mimo wire-tap channel,optimal power allocation,tree searching,perfect secrecy capacity,branch-and-bound technique,wireless channels,mimo communication,reformulation technique,telecommunication security,linearization technique,gaussian mimo wire-tap channel,information security,branch and bound,degradation,resource management,algorithm design and analysis,mimo,upper bound,design optimization,broadcasting,convex programming,global optimization,transmitters,data mining
Transmitter,Mathematical optimization,Algorithm design,Control theory,Computer science,MIMO,Communication channel,Information-theoretic security,Convex optimization,Optimization problem,Linearization
Conference
ISBN
Citations 
PageRank 
978-1-4244-2734-5
9
0.66
References 
Authors
12
3
Name
Order
Citations
PageRank
Jia Liu120218.09
Y. Thomas Hou22040186.12
Hanif D. Sherali33403318.40