You are here

PIRS3A: A Low Complexity Multi-knapsack-based Approach for User Association and Resource Allocation in HetNets


Bharat Agarwal, Mohammed Amine Togou, Marco Ruffini, Gabriel Muntean

Publication Type: 
Edited Conference Meeting Proceeding
The recent worldwide sanitary pandemic has made it clear that changes in user traffic patterns can create load balancing issues in networks (e.g., new peak hours of usage have been observed, especially in suburban residential areas). Such patterns need to be accommodated, often with reliable service quality. Although several studies have examined the user association and resource allocation (UA-RA) issue, there is still no optimal strategy to address such a problem with low complexity while reducing the time overhead. To this end, we propose Performance-Improved Reduced Search Space Simulated Annealing (PIRS 3 A), an algorithm for solving UA-RA problems in Heterogeneous Networks (HetNets). First, the UA-RA problem is formulated as a multiple 0/1 knapsack problem (MKP) with constraints on the maximum capacity of the base stations (BS) along with the transport block size (TBS) index. Second …
Conference Name: 
2021 IEEE International Conference on Communications Workshops (ICC Workshops)
Digital Object Identifer (DOI): 
Publication Date: 
Conference Location: 
United States of America
Research Group: 
Dublin City University (DCU)
Open access repository: