Distributed User Association and Femtocell Allocation in Heterogeneous Wireless Networks

Deployment of low-power low-cost small access points such as femtocell access points (FAPs) constitute an attractive solution for improving the existing macrocell access points' (MAPs) capacity, reliability, and coverage. However, FAP deployment faces challenging problems such as interference m...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2014-08, Vol.62 (8), p.3027-3043
Main Authors: Bayat, Siavash, Louie, Raymond H. Y., Zhu Han, Vucetic, Branka, Yonghui Li
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Allocations
Cellular communication
Games
Heuristic algorithms
Interference
Matching
Mathematical analysis
Mathematical models
Networks
Optimization
Resource management
Spark plasma sintering
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Deployment of low-power low-cost small access points such as femtocell access points (FAPs) constitute an attractive solution for improving the existing macrocell access points' (MAPs) capacity, reliability, and coverage. However, FAP deployment faces challenging problems such as interference management and the lack of flexible frameworks for deploying the FAPs by the service providers (SPs). In this paper, we propose a novel solution that jointly associates the user equipment (TIE) to the APs, and allocates the FAPs to the SPs such that the the total satisfaction of the TIEs in an uplink OFDMA network is maximized. We model the competitive behaviors among the TIEs, FAPs, and SPs as a dynamic matching game and we propose distributed algorithms to find the optimal TIE association and FAP allocations. We show analytically that the matching algorithms converge to the optimal and stable outcomes after a small number of iterations. Simulations and analytical results show the proposed mechanism is arbitrarily close to the global optimal solution by setting a design parameter (step number) but has significantly reduced overhead and complexity over the centralized algorithm.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2014.2339313