Early Acceptance Matching Game for User Association in 5G Cellular HetNet

TL;DR

This paper introduces a distributed matching algorithm called early acceptance (EA) for user association in 5G mmWave HetNets, offering near-optimal performance with improved speed and power efficiency over existing methods.

Contribution

The paper proposes a novel EA matching algorithm specifically designed for fast, distributed user association in 5G mmWave HetNets, outperforming traditional algorithms in efficiency and power consumption.

Findings

EA algorithm achieves near-optimal user association performance.

EA is faster and more power-efficient than the deferred acceptance algorithm.

Numerical results validate the effectiveness of the proposed method.

Abstract

In this paper we examine the use of matching theory for user association in millimeter wave (mmWave)-enabled cellular heterogeneous networks (HetNets). In a mmWave system, the channel variations can be fast and unpredictable, rendering centralized user association potentially inefficient. We propose an efficient distributed matching algorithm, called early acceptance (EA), tailored for user association in 5G HetNets. The effectiveness of the proposed algorithm is assessed by comparing its performance with the well-known deferred acceptance (DA) matching algorithm, in which user association is delayed until the algorithm finishes. Numerical results show that the proposed EA matching algorithm reaches a near-optimal solution when compared with a centralized user association, and leads to a more power-efficient and much faster user association process when compared to the distributed DA algorithm.