Resource Allocation in Spectrum-Sharing OFDMA Femtocells With Heterogeneous Services
Femtocells are being considered a promising technique to improve the capacity and coverage for indoor wireless users. However, the cross-tier interference in the spectrum-sharing deployment of femtocells can degrade the system performance seriously. The resource allocation problem in both the uplink...
Saved in:
Published in | IEEE transactions on communications Vol. 62; no. 7; pp. 2366 - 2377 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.07.2014
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Femtocells are being considered a promising technique to improve the capacity and coverage for indoor wireless users. However, the cross-tier interference in the spectrum-sharing deployment of femtocells can degrade the system performance seriously. The resource allocation problem in both the uplink and the downlink for two-tier networks comprising spectrum-sharing femtocells and macrocells is investigated. A resource allocation scheme for cochannel femtocells is proposed, aiming to maximize the capacity for both delay-sensitive users and delay-tolerant users subject to the delay-sensitive users' quality-of-service constraint and an interference constraint imposed by the macrocell. The subchannel and power allocation problem is modeled as a mixed-integer programming problem, and then, it is transformed into a convex optimization problem by relaxing subchannel sharing; finally, it is solved by the dual decomposition method. Subsequently, an iterative subchannel and power allocation algorithm considering heterogeneous services and cross-tier interference is proposed for the problem using the subgradient update. A practical low-complexity distributed subchannel and power allocation algorithm is developed to reduce the computational cost. The complexity of the proposed algorithms is analyzed, and the effectiveness of the proposed algorithms is verified by simulations. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
ISSN: | 0090-6778 1558-0857 |
DOI: | 10.1109/TCOMM.2014.2328574 |