Name
Abstract | ||
|---|---|---|
In this paper, we design joint information beam-forming and jamming beamforming to guarantee both transmit security and receive security for a full duplex base station (FD-BS). Specifically, we aim to maximize the secret transmit rate while constrain the secret receive rate to be greater than a predefined bound. We convert the original non-convex problem into a new sequence of subproblems where the semidefinite programming (SDP) relaxation can be applied to efficiently find the optimal solutions. We strictly prove that such a relaxation does not change the optimality for these subproblems. Then the global optimal solutions of the original non-convex problem can be obtained via a one-dimensional search. Simulation results are provided to verify the efficiency of the proposed algorithms. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/GLOCOM.2014.7037039 | GLOBECOM |
Keywords | Field | DocType |
full duplex base station,semidefinite programming relaxation,secret transmit rate maximization,transmit security,nonconvex problem,search problems,secret receive rate,array signal processing,global optimal solutions,concave programming,1d search,jamming beamforming,joint information beamforming,telecommunication security,jamming,receive security,sdp relaxation,null space,security,lead | Kernel (linear algebra),Base station,Beamforming,Computer science,Computer network,Jamming,Semidefinite programming,Secure communication,Duplex (telecommunications) | Conference |
ISSN | Citations | PageRank |
2334-0983 | 0 | 0.34 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fengchao Zhu | 1 | 151 | 8.32 |
| Feifei Gao | 2 | 3093 | 212.03 |
| Minli Yao | 3 | 222 | 17.30 |
| Jian Li | 4 | 0 | 0.34 |