Distributed Optimization of Hierarchical Small Cell Networks: A GNEP Framework

Jiaheng Wang, Wei Guan, Yongming Huang, Robert Schober, Xiaohu You

Abstract

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 a NUM design for small cell networks by trading off signaling overhead and complexity.

Introduction

The deployment of low-power small cell base stations (SBSs) within the coverage area of traditional macrocell base stations (MBSs) is a cornerstone of 5G network architecture. While this hierarchical structure significantly boosts network capacity and coverage, it introduces a complex interference landscape. SBSs interfere with each other and, more critically, with the MBS, potentially degrading the primary macrocell's service quality.

Coordinating these stations centrally is often unfeasible due to the latency and capacity constraints of backhaul links. This paper addresses the challenge of distributed interference management, enabling base stations to optimize their transmit power locally while strictly protecting macrocell users from excessive interference.

Methodology: The GNEP Framework

The authors leverage Generalized Nash Equilibrium Problem (GNEP) theory to model the network. Unlike standard games where players' strategy sets are independent, GNEPs incorporate "shared constraints"—in this case, a global limit on interference to protect the macrocell.

Key technical components include:

  • Variational Inequality (VI) Theory: Used to analyze the GNEP and prove the existence of a unique "Variational Equilibrium."
  • Distributed Pricing: A mechanism where macrocell users (MUEs) broadcast "price" information. Base stations adjust their power based on this price to avoid violating global constraints.
  • NUM-to-GNEP Mapping: The authors demonstrate that a non-convex Network Utility Maximization (NUM) problem—maximizing total network speed—can be solved by iterating through a sequence of penalized GNEP games.

Distributed Algorithms

The core of the distributed approach relies on two nested iterative processes.

Algorithm 1 serves as the inner loop, where base stations reach a best-response equilibrium for a given set of interference prices.

Algorithm 1: Distributed Best Response Algorithm for local power updates.

Algorithm 2 acts as the outer loop, updating the pricing information to ensure that global QoS constraints are satisfied across the network.

Algorithm 2: Distributed Pricing Algorithm for global constraint enforcement.

Performance Evaluation

The framework was evaluated using numerical simulations based on standard 3GPP path loss models. The setup featured 1 MBS and 6 SBSs serving 10 macrocell users and 60 small cell users.

Key results include:

  • Convergence: The algorithms demonstrate rapid convergence to stable power allocations. Proximal-point variants were shown to converge even faster than basic pricing models.
  • QoS Protection: The GNEP framework successfully maintained required QoS for macrocell users, whereas standard non-cooperative games often failed.
  • Sum-Rate Optimization: The GNEP-based NUM approach achieved total network speeds comparable to heavy-duty centralized optimization methods while remaining distributed.

Conclusion

This paper provides a unified framework for managing interference in hierarchical small cell networks. By bridging the gap between competitive game theory and global network utility maximization, the proposed GNEP framework offers a scalable solution that balances signaling overhead with network performance. Future work will explore extensions to multi-macrocell scenarios and highly dynamic environments.

Summary updated

Abstract

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 a NUM design for small cell networks by trading off signaling overhead and complexity.
BibTeX
@article{wang2017distributed,
  author = {Jiaheng Wang and Wei Guan and Yongming Huang and Robert Schober and Xiaohu You},
  title = {{Distributed Optimization of Hierarchical Small Cell Networks: A GNEP Framework}},
  journal = {IEEE J. Sel. Areas Commun.},
  year = {2017},
  url = {https://openreview.net/forum?id=-fIAFdCjy_},
}
Figure