By Topic

Achieving User-Level Fairness in Open-Access Femtocell-Based Architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhixue Lu ; Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA ; Bansal, T. ; Sinha, P.

Femtocell-based architectures have the potential to position the cellular service providers to compete head-on with the WiFi market. However, significant interference can happen due to unplanned deployments. Current use of hard partitioning approaches for resource allocation, and lack of guidelines for configuring the femtocells, makes it difficult to obtain significant performance gains over traditional cellular networks. In this paper, we study the dynamic OFDMA subchannel assignment problem while jointly considering power assignment and association control to provide maxmin fairness. Toward this objective, we first consider a noninterfering model (NINT model), which disallows interfering femtocells in the solution. A more general interfering model (INT model) is then considered under which the problem is transformed into the partition coloring problem. We then show the NP-hardness of the problems and design centralized approximation algorithms with provable bounds and distributed solutions. Through extensive simulations in realistic settings we show that, compared to previous work, our solutions under the NINT model can achieve two times the minimum throughput, and under the INT model the minimum throughput can be up to three times the baseline algorithms.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:12 ,  Issue: 10 )