Distributed Resource Allocation in Virtualized Full-Duplex Relaying Networks

One significant challenge of wireless virtualization is how to allocate the virtual resources efficiently with various constraints and requirements. Most existing works have not considered relaying in wireless virtualization. However, relaying is regarded as one of the key components of future wireless networks. Furthermore, recent advances in self-interference cancellation techniques enable full-duplex relaying (FDR) systems, which transmit and receive simultaneously in the same frequency band with high spectrum efficiency. Different from existing works, we first introduce the idea of wireless virtualization into FDR networks and propose a virtual resource management architecture for virtualized FDR networks. Then, we formulate the virtual resource allocation as an optimization problem while taking the residual self-interference due to FDR and the requirements of wireless virtualization into account. Since the formulated problem is a mixed combinatorial and nonconvex optimization problem, it involves high computational complexity to solve it. To solve it efficiently, we transform the original problem to a convex optimization problem, and an efficient alternating direction method of multipliers (ADMM)-based distributed virtual resource allocation algorithm is developed to solve the convex problem. Extensive simulations are presented to show the effectiveness of the proposed scheme. It is demonstrated that the proposed virtualized FDR network is able to exploit the advantages of FDR and wireless virtualization.