Graph-based joint relay assignment and power allocation optimization for full-duplex networks

Cooperative communications and full-duplex (FD) relaying have been proposed to meet the ever increasing data traffic demands and fully exploit the scarce spectrum resources. In this paper, we consider FD relaying networks with multiple source-destination (S-D) pairs and multiple FD relays. We propose the joint optimal relay assignment and power allocation (ORAPA) scheme to maximize the sum rate of the network. The sum rate maximization problem is formulated as a mixed-integer nonlinear programming (MENLP) problem. We provide an equivalent maximum weighted bipartite matching (MWBM) problem to solve the MINLP issue and reduce computational complexity by adopting the Hungarian algorithm. Simulations results are provided to verify the effectiveness of our proposed scheme.