Joint optimization of power consumption and load balancing in wireless dynamic network architecture

Abstract

The concept of the wireless dynamic network architecture (DNA) stands for a system design, which allows terminals to convert into temporary access points (APs) when necessary. In this paper, we propose a framework to solve the problem of load balancing in DNA. Particularly, the user association in DNAs is optimized to minimize the number of active APs and the network cost in terms of tradeoff between power and load, while ensuring users' quality of service (QoS). In general, such a problem is a non-convex mixed integer nonlinear program in the sense that its continuous relaxation is a non-convex problem. To solve this optimization, we use the standard continuous relaxation method and approximate the relaxed problem by a series of second order cone programs with the aid of successive convex approximation (SCA) framework. Numerical results show that the proposed algorithm converges within a few iterations and jointly minimizes the network cost and the number of APs in the network.