Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 11 - Resource Allocation in Ultra-dense Networks

  • from Part III - Resource Allocation and Network Management
  • Edited by Haijun Zhang, Jemin Lee, Tony Q. S. Quek, Singapore University of Technology and Design, Chih-Lin I
  • Book:
    Ultra-dense Networks
    Published online:
    12 October 2020
    Print publication:
    26 November 2020, pp 193-208

  • Summary

    With the increase of access point (AP) density and the exponential growth of mobile devices supported by ultra dense networks (UDNs), overlapped user-centric (UC) clustering is becoming a promising design principle for guaranteeing the quality of service (QoS) required by each UE. However, the overlapped UC clustering has to be jointly designed with resource allocation in UDNs. In this context, both the traffic-load balancing and the limited availability of orthogonal resource blocks (RBs) are carefully considered in UDNs. To tackle these challenges, we formulate a joint overlapped UC clustering and resource allocation problem with the goal of maximizing the system’s spectral efficiency (SE). With the aid of the graph-theoretical framework, the problem is decoupled into two independent subproblems, and a distributed overlapped UC clustering solution as well as a graph-based resource allocation scheme were proposed. Our numerical results quantify the superior performance of the proposed framework in terms of both its per area aggregated user rate (PAAR) and user rate.