SOCP based joint throughput maximization and user association in Dynamic Networks

We consider new Dynamic Network Architecture (DNA) which provides significant soft capacity in the network enabling a wide range of adaptations to traffic demand variations without any change in the fixed network infrastructure. To maximize the system throughput we propose a new second order cone programming (SOCP) based algorithm to optimize jointly the access point (AP) selection and the downlink resource allocation in the DNA. Beamforming is used to minimize the mutual interference between the users. The main contribution of the paper is in the series of approximations used to convert a mixed integer non-linear program into its convex approximation problem. The numerical results demonstrate that the linearized AP selection variables remain near integer which means that the convexifying series of approximations do not introduce significant errors while significantly simplifying the optimization algorithm.