Robust Resource Allocation With Joint Carrier Aggregation in Multi-Carrier Cellular Networks

  • Shajaiah H
  • Abdelhadi A
  • Clancy T
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present a robust optimal resource allocation (RA) with joint carrier aggregation (CA) approach to allocate multiple carriers resources optimally among users with elastic and inelastic traffic in cellular networks. We use utility proportional fairness allocation policy, where the fairness among users is in utility percentage of the application running on the user equipment (UE). We introduce an efficient RA approach to allocate the network spectrum resources from multiple carriers based on a CA scenario. We present a robust RA algorithm that allocates optimal aggregated rates for both high-traffic and low-traffic situations. Our distributed RA algorithm allocates an optimal rate to each user from all carriers in its range while providing the minimum price for the allocated rate. In addition, we analyze the convergence of the algorithm with different network traffic densities and show that our algorithm provides traffic dependent pricing for network providers. Finally, we present simulation results for the performance of our RA algorithm.

Cite

CITATION STYLE

APA

Shajaiah, H., Abdelhadi, A., & Clancy, T. C. (2017). Robust Resource Allocation With Joint Carrier Aggregation in Multi-Carrier Cellular Networks. IEEE Transactions on Cognitive Communications and Networking, 4(1), 53–65. https://doi.org/10.1109/tccn.2017.2773082

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free