Skip to main content
DORAS
DCU Online Research Access Service
Login (DCU Staff Only)
PIRS3A: A low complexity multi-knapsack-based approach for user association and resource allocation in HetNets

Agarwal, Bharat ORCID: 0000-0002-4040-8145, Togou, Mohammed Amine ORCID: 0000-0002-8374-910X, Ruffini, Marco ORCID: 0000-0001-6220-0065 and Muntean, Gabriel-Miro ORCID: 0000-0002-9332-4770 (2021) PIRS3A: A low complexity multi-knapsack-based approach for user association and resource allocation in HetNets. In: 2021 IEEE International Conference on Communications Workshops (ICC Workshops), 14-23 June 2021, Montreal, Canada (Virtual).

Full text available as:

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
896kB

Abstract

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 (P IRS3A), 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, the proposed P IRS3A is used to solve the formulated MKP. Simulation results show that P IRS3A outperforms existing schemes in terms of variability and Quality of Service (QoS), including throughput, packet loss ratio (PLR), delay, and jitter. Simulation results also show that P IRS3A generates solutions that are very close to the optimal solution compared to the default simulated annealing (DSA) algorithm.

Item Type:Conference or Workshop Item (Paper)
Event Type:Conference
Refereed:Yes
Uncontrolled Keywords:Heterogeneous Networks; Traffic Optimization; Simulated Annealing; QoS; TBS index; COVID-19
Subjects:Engineering > Electronics
DCU Faculties and Centres:DCU Faculties and Schools > Faculty of Engineering and Computing > School of Electronic Engineering
Copyright Information:© 2021 IEEE
Funders:Science Foundation Ireland (SFI) via grants 18/CRT/6224 (SFI Centre for Research Training in Digitally-Enhanced Reality D-REAL), 16/SP/3804 (Enable) and 12/RC/2289 P2 (Insight).
ID Code:28021
Deposited On:17 Jan 2023 16:49 by Bharat Agarwal . Last Modified 18 Jan 2023 09:56

Downloads

Downloads per month over past year

Archive Staff Only: edit this record

  • Student Email
  • Staff Email
  • Student Apps
  • Staff Apps
  • Loop
  • Disclaimer
  • Privacy
  • Contact Us