On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and Broadcast Channels

Rui Zhang, Shuguang Cui, Ying-Chang Liang

Introduction

In the evolving landscape of wireless communications, Cognitive Radio (CR) has emerged as a pivotal technology for improving spectral efficiency. By allowing secondary users (SUs) to opportunistically access spectrum licensed to primary users (PUs), CR systems can mitigate the perceived spectrum scarcity. This paper, authored by Rui Zhang, Shuguang Cui, and Ying-Chang Liang in 2009, provides a foundational theoretical analysis of the ergodic sum capacity for fading cognitive multiple-access and broadcast channels.

The study focuses on multi-user scenarios where the secondary network must maximize its throughput while strictly adhering to interference constraints that protect the primary network. The authors derive optimal power allocation strategies and demonstrate that simple scheduling mechanisms, such as Dynamic Time-Division Multiple Access (D-TDMA), are often optimal for maximizing sum capacity under these constraints.

System Model

The paper investigates two primary multi-user configurations in a fading environment: the Cognitive Multiple-Access Channel (C-MAC) and the Cognitive Broadcast Channel (C-BC).

Cognitive Multiple-Access Channel (C-MAC)

In the C-MAC model, multiple secondary users ($SU_1, \dots, SU_K$) transmit data to a single secondary base station (BS). This transmission must be managed such that the aggregate interference at the primary receivers ($PR_1, \dots, PR_M$) remains below a specified threshold.

System model for the Cognitive Multiple-Access Channel (C-MAC).

Cognitive Broadcast Channel (C-BC)

Conversely, the C-BC model involves a single secondary BS transmitting independent data streams to multiple secondary users. Similar to the C-MAC, the BS must regulate its transmit power to ensure that the interference leaked to the primary receivers does not exceed the permissible limits.

System model for the Cognitive Broadcast Channel (C-BC).

The authors consider two types of constraints: Transmit-Power Constraints (TPC) on the secondary transmitters and Interference-Power Constraints (IPC) to protect primary receivers. These are further categorized into Long-Term (LT) constraints, which average power over time, and Short-Term (ST) constraints, which impose strict limits at every fading state.

Methodology

The problem of maximizing the secondary network's sum-rate is framed as a convex optimization task. The authors employ several mathematical techniques to solve this:

  • Lagrange Duality: Complex long-term average problems are decomposed into simpler sub-problems for each fading state using dual variables, which act as "shadow prices" for power and interference.
  • KKT Conditions: Analysis of Karush-Kuhn-Tucker conditions reveals the structure of optimal power allocation.
  • MAC-BC Duality: This principle allows the capacity of the broadcast channel to be solved by transforming it into an equivalent multiple-access channel problem.
  • Numerical Ellipsoid Method: This iterative method is used to find optimal dual variables when closed-form solutions are unavailable.

Performance was evaluated through Monte Carlo simulations using 10,000 randomly generated channel power gain vectors following a Circular Symmetric Complex Gaussian (CSCG) distribution to model Rayleigh fading.

Key Insights and Results

The research yielded several significant findings regarding optimal resource allocation in cognitive networks:

  • Optimality of D-TDMA: For the C-BC, Dynamic Time-Division Multiple Access (D-TDMA) is mathematically optimal across all constraint types. The BS should allocate all available power to the "best" user at any given time.
  • The "M+1" Rule for MAC: In the C-MAC with short-term interference constraints, the number of users transmitting simultaneously should not exceed $M+1$, where $M$ is the number of primary receivers.
  • Interference-Aware Water-Filling: The optimal power allocation resembles a modified water-filling algorithm where the "water level" is adjusted based on the "price" of interference. This introduces a new form of multiuser diversity: a user may be prioritized not just for a strong signal path to the BS, but for a weak interference path to the primary receivers.
  • Capacity Gains and Saturation: Long-term constraints provide significantly higher capacity than short-term ones by allowing the system to "save" interference budget for favorable channel conditions. However, as transmit power increases, capacity eventually saturates because the interference constraint becomes the dominant bottleneck.

Limitations and Future Work

While foundational, the study relies on the assumption of perfect Channel State Information (CSI) for all links, including those to primary receivers, which is challenging to obtain in practice. The analysis is also limited to Single-Input Single-Output (SISO) nodes. Future research directions include extending these models to Multiple-Input Multiple-Output (MIMO) systems, accounting for spectrum sensing errors, and addressing the computational complexity of real-time optimal resource allocation in fast-fading environments.

Summary updated

BibTeX
@article{zhang2009ergodic,
  author = {Rui Zhang and Shuguang Cui and Ying-Chang Liang},
  title = {{On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and Broadcast Channels}},
  journal = {IEEE Trans. Information Theory},
  year = {2009},
  url = {https://openreview.net/forum?id=G07LxEPMRx},
}
Figure