Graph based resource allocation for physical layer security in full-duplex cellular networks

Tinghan Yang, Rongqing Zhang, Xiang Cheng, Liuqing Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
EditorsMerouane Debbah, David Gesbert, Abdelhamid Mellouk
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467389990
DOIs
StatePublished - Jul 28 2017
Externally publishedYes
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: May 21 2017May 25 2017

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607

Other

Other2017 IEEE International Conference on Communications, ICC 2017
Country/TerritoryFrance
CityParis
Period5/21/175/25/17

Keywords

  • Full-duplex
  • graph theory
  • physical layer security
  • resource allocation

Fingerprint

Dive into the research topics of 'Graph based resource allocation for physical layer security in full-duplex cellular networks'. Together they form a unique fingerprint.

Cite this