Graph-based joint user-centric overlapped clustering and resource allocation in ultra dense networks

Abstract

With the increase of access point (AP) density and the exponential growth of mobile devices supported by ultra dense networks (UDNs), user-centric overlapped clustering relying on AP cooperation is becoming a promising design principle for guaranteeing the quality of service (QoS) required by each UE. This ambitious goal can be achieved by the joint design of user-centric overlapped clustering and resource allocation. In this context, both the traffic-load balancing and the limited availability of orthogonal resource blocks (RBs) have to be carefully considered in UDNs. To tackle these challenges, we formulate a joint user-centric overlapped clustering and resource allocation problem with the goal of maximizing the system's spectral efficiency (SE). To efficiently solve this problem, it is decoupled into two subproblems, which can be solved independently with the aid of our graph-theoretical framework. We first develop a novel distributed three-stage user-centric clustering solution, which is aware of the APs' traffic-loads. Then, based on the overlapped clusters constructed, we propose a novel two-stage graph-based user-centric resource allocation scheme for mitigating the resultant inter-cluster interference, despite the limited availability of orthogonal RBs. Our numerical results confirm the benefits of the proposed framework and show that it outperforms the benchmark solutions in terms of both its per area aggregated user rate (PAAR) and user rate.

More information

Identifiers

ORCID for Lajos Hanzo: orcid.org/0000-0002-2636-5214

Catalogue record

Export record

Altmetrics