Book contents
- Frontmatter
- Contents
- List of Contributors
- Part I Overview
- Part II Physical Layer Design
- Part III Resource Allocation and Network Management
- 9 Delay and Traffic Matching in Ultra-dense Networks
- 10 Traffic Offloading in Software Defined Ultra-dense Networks
- 11 Resource Allocation in Ultra-dense Networks
- 12 Wireless Edge Caching in Ultra-dense Networks
- 13 User Association in Ultra-dense Networks
- 14 UAV-Based Ultra-dense Networks
- 15 Generalized Low-Rank Optimization for Ultra-dense Fog-RANs
- Part IV Field Trials and Tests
- Index
11 - Resource Allocation in Ultra-dense Networks
from Part III - Resource Allocation and Network Management
Published online by Cambridge University Press: 12 October 2020
- Frontmatter
- Contents
- List of Contributors
- Part I Overview
- Part II Physical Layer Design
- Part III Resource Allocation and Network Management
- 9 Delay and Traffic Matching in Ultra-dense Networks
- 10 Traffic Offloading in Software Defined Ultra-dense Networks
- 11 Resource Allocation in Ultra-dense Networks
- 12 Wireless Edge Caching in Ultra-dense Networks
- 13 User Association in Ultra-dense Networks
- 14 UAV-Based Ultra-dense Networks
- 15 Generalized Low-Rank Optimization for Ultra-dense Fog-RANs
- Part IV Field Trials and Tests
- Index
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.
- Type
- Chapter
- Information
- Ultra-dense NetworksPrinciples and Applications, pp. 193 - 208Publisher: Cambridge University PressPrint publication year: 2020