Cognitive Access Policies under a Primary ARQ Process via Forward-Backward Interference Cancellation

Nicolò Michelusi, Petar Popovski, Osvaldo Simeone, Marco Levorato, Michele Zorzi

TL;DR

This paper introduces a novel cognitive radio access technique that leverages the Primary User's (PU) Hybrid Automatic Retransmission Request (HARQ) protocol to enable Secondary Users (SUs) to perform interference cancellation (IC). By intelligently deciding when to transmit, SUs can maximize their throughput while ensuring minimal disruption to the PU.

What Problem Does This Paper Address?

In cognitive radio (CR) networks, Secondary Users (SUs) aim to opportunistically access spectrum licensed to Primary Users (PUs). A key challenge is how SUs can transmit without causing unacceptable interference to the PU. Traditional approaches often involve SUs sensing the spectrum and inferring PU activity, which can be complex and imperfect. This paper tackles the problem of SU access under a specific PU transmission scheme: Type-I Hybrid ARQ. This ARQ protocol inherently introduces redundancy through retransmissions, which this work exploits. The authors aim to design SU access policies that maximize SU throughput while adhering to strict constraints on PU performance degradation and SU power consumption.

Methods

The core innovation lies in two interference cancellation (IC) mechanisms at the SU receiver (SUrx):

  • Forward IC (FIC): After SUrx successfully decodes a PU message, it uses this knowledge to cancel the PU's interference in subsequent PU retransmissions. This improves the SU's ability to decode its own messages.
  • Backward IC (BIC): If an SU transmission fails due to severe PU interference, SUrx buffers the received signal. If the PU message is later successfully decoded, SUrx can use this information to recover the previously failed SU transmission.

These IC mechanisms are integrated into a Markov Decision Process (MDP) framework. The SU's access policy is modeled as a randomized strategy that determines the probability of transmission in each network state, defined by the PU's ARQ state, the SU's buffer state, and whether the SUrx has knowledge of the PU message. The problem is formulated as an optimization problem to maximize long-term SU throughput subject to PU interference and SU power constraints. The authors derive optimal policies for different regimes (low vs. high SU access rate) and propose an algorithm to find these policies.

Datasets

Not discussed in the paper. The paper focuses on theoretical modeling and simulation-based evaluation using defined parameters.

Key Insights and Ideas

  • Exploiting PU Redundancy: The most significant insight is that the inherent redundancy in PU ARQ retransmissions can be actively leveraged by SUs for interference cancellation, rather than just being a nuisance.
  • Two-Pronged IC Strategy: The combination of Forward IC (for future PU transmissions) and Backward IC (for past SU transmissions) provides a comprehensive approach to maximize SU throughput across the entire PU ARQ cycle.
  • State-Aware Access is Crucial: The optimal SU access policy is highly dependent on the network state, particularly whether the SUrx knows the PU message. Prioritizing access when the PU message is known enables more effective IC.
  • Trade-off Between Throughput and Interference: The paper clearly illustrates the fundamental trade-off SUs face: transmitting more can increase their throughput but also risks causing more interference to the PU, potentially hindering their own IC capabilities.
  • "Cost-Effectiveness" of Access States: Accessing the channel when the PU message is known (enabling FIC) is shown to be more "cost-effective" for SU throughput than accessing when the PU message is unknown (relying on BIC).

Key Results

  • The proposed FIC/BIC technique significantly outperforms "FIC only" and "no FIC/BIC" schemes in terms of SU throughput.
  • The optimal SU access policy prioritizes transmissions when SUrx has knowledge of the PU message (enabling FIC).
  • An algorithm is provided to optimally allocate SU access opportunities in states where the PU message is unknown, balancing BIC potential with interference.
  • Numerical results demonstrate that the SU throughput is maximized when the PU interference is either very weak (allowing easy decoding) or strong enough for successful PU decoding and subsequent interference removal.
  • The performance gains from FIC/BIC increase with the PU ARQ deadline (D), as more retransmission opportunities become available.

Limitations and Future Work

  • Idealized Assumptions: The paper assumes ideal feedback channels between SUrx and SUtx, perfect PU codebook knowledge, and perfect synchronization. Real-world implementations would need to account for imperfect versions of these.
  • Fixed Rates: The SU and PU transmission rates are treated as fixed parameters. Future work could explore dynamic rate adaptation.
  • Degenerate Scenario Analysis: While a general framework is presented, a detailed analysis of a "degenerate" cognitive radio network (where SU-PU interference is negligible) is provided, which might not fully capture all complex interference scenarios.
  • Generalization to Practical Codes: The analysis assumes Gaussian signaling and capacity-achieving codes. Extending the results to practical coding schemes would be valuable.
  • PU Obliviousness: The PU remains unaware of the SU. Investigating scenarios where the PU is aware and can adapt its behavior could lead to more collaborative spectrum sharing.

Summary updated

Abstract

This paper introduces a novel technique for access by a cognitive Secondary User (SU) using best-effort transmission to a spectrum with an incumbent Primary User (PU), which uses Type-I Hybrid ARQ. The technique leverages the primary ARQ protocol to perform Interference Cancellation (IC) at the SU receiver (SUrx). Two IC mechanisms that work in concert are introduced: Forward IC, where SUrx, after decoding the PU message, cancels its interference in the (possible) following PU retransmissions of the same message, to improve the SU throughput; Backward IC, where SUrx performs IC on previous SU transmissions, whose decoding failed due to severe PU interference. Secondary access policies are designed that determine the secondary access probability in each state of the network so as to maximize the average long-term SU throughput by opportunistically leveraging IC, while causing bounded average long-term PU throughput degradation and SU power expenditure. It is proved that the optimal policy prescribes that the SU prioritizes its access in the states where SUrx knows the PU message, thus enabling IC. An algorithm is provided to optimally allocate additional secondary access opportunities in the states where the PU message is unknown. Numerical results are shown to assess the throughput gain provided by the proposed techniques.
BibTeX
@article{michelusi2013cognitive,
  author = {Nicolò Michelusi and Petar Popovski and Osvaldo Simeone and Marco Levorato and Michele Zorzi},
  title = {{Cognitive Access Policies under a Primary ARQ Process via Forward-Backward Interference Cancellation}},
  journal = {IEEE JSAC},
  year = {2013},
  doi = {10.1109/jsac.2013.131112},
}
Figure