DC programming and DCA for a novel resource allocation problem in emerging area of cooperative physical layer security

Abstract

In this paper, we consider the problem of resource allocation in emerging area of cooperative physical layer security, whose objective function is of the difference of two convex functions, called DC function, and whose some constraints are coupling. We propose a novel DC decomposition for the objective function and use DCA (DC algorithms) to solve this problem. The main advantage of the proposed DC decomposition is that it leads to strongly convex quadratic sub-problems that can be easily solved by both distributed and centralized methods. The numerical results show the efficiency of this DC decomposition compared with the one proposed in ([2]). The DC decomposition technique in this article may be applied for a wide range of multiuser DC problems in communication systems, signal processing and networking.