Semidefinite Relaxation and Randomization for Dynamic Cell Association in Heterogeneous Networks


S. Corroy, R. Mathar,


        In this paper, we consider a heterogeneous network with one macro node and one pico node. We are concerned with the problem of associating users in the macro cell, to either the macro node or the pico node, in order to maximize the sum rate in the downlink. We formulate a new theoretical framework to study this problem and derive an upper bound on the achievable sum rate using semidefinite relaxation. Furthermore, we propose a randomized heuristic to produce a feasible solution, and most importantly, give an analytic guarantee on its performance. Independently of the problem data, we can ensure a worst case performance for the randomization method. In practice, this guarantee is as good as the standard best SNR heuristic typically used in 3GPP LTE networks.

BibTEX Reference Entry 

	author = {Steven Corroy and Rudolf Mathar},
	title = "Semidefinite Relaxation and Randomization for Dynamic Cell Association  in Heterogeneous Networks",
	pages = "2397-2402",
	booktitle = "{IEEE} Global Communications Conference 2012 (GLOBECOM 2012)",
	address = {Anaheim, California, USA},
	month = Dec,
	year = 2012,
	hsb = hsb999910279069,


 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.