Joint cell selection and radio resource allocation in MIMO small cell networks via successive convex approximation

It is widely recognized that one of the factors that are going to yield the most significant capacity increase in wireless networks is spatial reuse of radio resources through dense deployment of radio access points. This leads to the development of small cell networks where different size cells, e.g. macro cells, picocells, femtocells, relays, coexist under the same standard. Of course, dense deployment is able to unravel its potential benefits only provided that interference is properly managed. In this paper, we propose an algorithm able to perform cell association and radio resource allocation jointly, in order to maximize the sum rate in a MIMO (interference) network. Cell selection is inherently a combinatorial problem. To deal with the nonconvexity, we introduce a suitably chosen convex relaxation of the objective function and develop a fast algorithm converging to a locally optimal solution of the nonconvex problem.