Abstract

This paper considers the problem of associating users, in an heterogeneous network, to either a macro node or a pico node within a tightly coordinated cell cluster. We introduce a new theoretical framework to model this problem for the downlink and derive upper bounds for achievable sum rate and minimum rate using convex optimization. Further we propose heuristics, consisting in dynamic cell association, enabling to achieve performance close to the upper bounds. Finally we implement these heuristics in an LTE simulator and show the potential of such dynamic cell association for a small LTE network.

Keywords

HeuristicsTelecommunications linkComputer scienceNode (physics)MaximizationMacroMathematical optimizationAssociation (psychology)Small cellUpper and lower boundsConvex optimizationRegular polygonCellular networkComputer networkMathematicsEngineering

Affiliated Institutions

Related Publications

Publication Info

Year
2012
Type
article
Pages
888-892
Citations
47
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

47
OpenAlex
2
Influential
36
CrossRef

Cite This

Steven Corroy, Laetitia Falconetti, Rudolf Mathar (2012). Cell association in small heterogeneous networks: Downlink sum rate and min rate maximization. 2012 IEEE Wireless Communications and Networking Conference (WCNC) , 888-892. https://doi.org/10.1109/wcnc.2012.6214499

Identifiers

DOI
10.1109/wcnc.2012.6214499

Data Quality

Data completeness: 81%