Abstract

Interference management via resource allocation under the quality of service (QoS) provisions is a crucial challenge for next-generation cellular networks. The task becomes more problematic due to emerging services and applications with non-homogeneous QoS requirements. The resource allocation problem has mostly been investigated using ideal communication links, where it is generally assumed that information can be relayed perfectly between base stations (BSs). The impact of delays and time-outs at communication links during coordination of BSs is not well understood. Furthermore, it is generally assumed that perfect channel state information is available at BSs which may not always be possible due to large channel feedback delays or estimation errors. In this paper, we propose a power adjustment algorithm for heterogeneous networks which considers varying QoS requirements of users. Contrary to the power allocation approaches in the literature, channel state information is not required for power adjustment. The performance of the algorithm is evaluated both analytically and numerically under a setup with non-ideal communication links. The theoretical analysis unveils that the proposed algorithm achieves optimum power allocation with respect to the QoS requirements of users. The numerical results are not only in agreement with theoretical analysis, but also exhibits significant improvement in terms of overall network performance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.