Distributed Optimization of Hierarchical Small Cell Networks: A GNEP Framework

Deployment of small cell base stations (SBSs) overlaying the coverage area of a macrocell BS (MBS) results in a two-tier hierarchical small cell network. Cross-tier and inter-tier interference not only jeopardize primary macrocell communication but also limit the spectral efficiency of small cell co...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications Vol. 35; no. 2; pp. 249 - 264
Main Authors: Jiaheng Wang, Wei Guan, Yongming Huang, Schober, Robert, Xiaohu You
Format: Journal Article
Language:English
Published: New York IEEE 01.02.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Complexity
Computer architecture
Distributed optimization
Economic models
Game theory
Games
generalized Nash equilibrium problem
Interference
Macrocell networks
Maximization
Microprocessors
network utility maximization
Networks
Optimization
Overlaying
Quality of service
Quality of service architectures
Radio equipment
small cell network
variational inequality
ISSN:0733-8716, 1558-0008
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Deployment of small cell base stations (SBSs) overlaying the coverage area of a macrocell BS (MBS) results in a two-tier hierarchical small cell network. Cross-tier and inter-tier interference not only jeopardize primary macrocell communication but also limit the spectral efficiency of small cell communication. This paper focuses on distributed interference management for downlink small cell networks. We address the optimization of transmit strategies from both the game theoretical and the network utility maximization (NUM) perspectives and show that they can be unified in a generalized Nash equilibrium problem (GNEP) framework. Specifically, the small cell network design is first formulated as a GNEP, where the SBSs and MBS compete for the spectral resources by maximizing their own rates while satisfying global quality of service (QoS) constraints. We analyze the GNEP via variational inequality theory and propose distributed algorithms, which only require the broadcasting of some pricing information, to achieve a generalized Nash equilibrium (GNE). Then, we also consider a nonconvex NUM problem that aims to maximize the sum rate of all BSs subject to global QoS constraints. We establish the connection between the NUM problem and a penalized GNEP and show that its stationary solution can be obtained via a fixed point iteration of the GNE. We propose GNEP-based distributed algorithms that achieve a stationary solution of the NUM problem at the expense of additional signaling overhead and complexity. The convergence of the proposed algorithms is proved and guaranteed for properly chosen algorithm parameters. The proposed GNEP framework can scale from a QoS constrained game to an NUM design for small cell networks by trading off signaling overhead and complexity.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2017.2658999