In this paper, we investigate the physical layer security issue in a cellular network with a full-duplex (FD) base station and multiple uplinks and downlinks. We provide a novel cooperative jamming mechanism in order to enhance the secrecy performance for the investigated scenario. The total bandwidth is divided into multiple resource blocks (RBs). In our investigation, each uplink or downlink can acquire at most one RB, and each RB can only be assigned to one uplink and one downlink. We formulate the secrecy capacity maximization problem as a joint RB assignment and power allocation problem, and then propose a bipartite graph based propose-and-decide algorithm (BGPDA) to solve this problem effectively and efficiently. The numerical simulations verify the efficiency of our proposed algorithm.
|Original language||English (US)|
|Title of host publication||2017 IEEE International Conference on Communications, ICC 2017|
|Editors||Merouane Debbah, David Gesbert, Abdelhamid Mellouk|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|State||Published - Jul 28 2017|
|Event||2017 IEEE International Conference on Communications, ICC 2017 - Paris, France|
Duration: May 21 2017 → May 25 2017
|Name||IEEE International Conference on Communications|
|Other||2017 IEEE International Conference on Communications, ICC 2017|
|Period||5/21/17 → 5/25/17|
Bibliographical noteFunding Information:
VI. ACKNOWLEDGEMENT This work was jointly supported by the National Natural Science Foundation of China (Grant No. 61622101 and 61571020), the Ministry National Key Research and Development Project under Grant 2016YFE0123100, the National 973 project (Grant No. 2013CB336700), the open research fund of National Mobile Communications Research Laboratory, Southeast University (Grant No. 2016D03), and the National Science Foundation under grant number CNS-1343189.
© 2017 IEEE.
- graph theory
- physical layer security
- resource allocation