Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous

Lin Chen, Shuyu Shi, Kaigui Bian, Yusheng Ji

Abstract

In cognitive radio (CR) networks, "TTR", a.k.a. time-to-rendezvous, is one of the most important metrics for evaluating the performance of a channel hopping (CH) rendezvous protocol, and it characterizes the rendezvous delay when two CRs perform channel hopping. There exists a trade-off of optimizing the average or maximum TTR in the CH rendezvous protocol design. On one hand, the random CH protocol leads to the best "average" TTR without ensuring a finite "maximum" TTR (two CRs may never rendezvous in the worst case), or a high rendezvous diversity (multiple rendezvous channels). On the other hand, many sequence-based CH protocols ensure a finite maximum TTR (upper bound of TTR) and a high rendezvous diversity, while they inevitably yield a larger average TTR. In this paper, we strike a balance in the average-maximum TTR trade-off for CR rendezvous by leveraging the advantages of both random and sequence-based CH protocols. Inspired by the neighbor discovery problem, we establish a design framework of creating a wake-up schedule whereby every CR follows the sequence-based (or random) CH protocol in the awake (or asleep) mode. Analytical and simulation results show that the hybrid CH protocols under this framework are able to achieve a greatly improved average TTR as well as a low upper-bound of TTR, without sacrificing the rendezvous diversity.

Introduction

In Cognitive Radio (CR) networks, Secondary Users (SUs) must identify a common frequency channel to establish communication, a process termed rendezvous. Because Primary (licensed) Users (PUs) may occupy channels at any time, SUs employ Channel Hopping (CH) protocols to search for one another.

Designing these protocols involves a fundamental trade-off between two metrics: Average Time-To-Rendezvous (ATTR) and Maximum Time-To-Rendezvous (MTTR). Random CH protocols offer excellent ATTR but lack worst-case guarantees, potentially leading to infinite MTTR. Conversely, sequence-based CH protocols provide deterministic guarantees (finite MTTR) and high channel diversity but suffer from significantly higher ATTR due to their rigid mathematical structure. This research proposes a hybrid framework that combines the strengths of both approaches.

The Hybrid Framework

To bridge the gap between random and deterministic hopping, the authors adapt "wake-up schedule" concepts from Wireless Sensor Networks (WSNs). In WSNs, nodes use binary schedules to alternate between awake and asleep states to conserve energy while ensuring eventual overlap.

In this framework, the wake-up schedule dictates the hopping mode:

  • Awake (1): The radio follows a deterministic sequence-based protocol (e.g., CRSEQ or Jump-Stay).
  • Asleep (0): The radio performs random channel hopping.
Construction of the hybrid CH sequence by interleaving a deterministic sequence with random slots (r) based on a wake-up schedule.

To ensure theoretical guarantees, the authors introduce a Padding Scheme. By slightly adjusting the channel pool size $N$ to a new value $N'$, they ensure that the period of the deterministic sequence and the length of the wake-up schedule are co-prime. This prevents the sequences from entering repetitive loops that could miss rendezvous opportunities.

Key Results and Performance

The framework was evaluated using synthetic simulations with 11 channels and varying PU traffic loads (25% and 50%). The results demonstrate that injecting random hops into the "asleep" slots of the schedule acts as a stochastic shortcut, significantly reducing ATTR while the deterministic sequence maintains the safety net of a bounded MTTR.

Key findings include:

  • Reduced Average Latency: As the duty cycle of the wake-up schedule (the ratio of awake slots) decreases, the ATTR drops significantly. A 5/14 duty cycle achieved vastly superior average performance compared to baseline deterministic protocols.
  • Preserved Diversity: Despite the introduction of random hopping, the rendezvous diversity—the ability to meet on multiple different channels—remains high. This is critical for avoiding localized interference or jamming.
Comparison of rendezvous diversity rates across different wake-up schedule duty cycles and PU traffic loads.

Conclusion

By repurposing WSN neighbor-discovery mathematics for cognitive radio, this hybrid framework successfully optimizes the trade-off between average and maximum rendezvous delay. The deterministic component preserves strict MTTR bounds, while the stochastic component provides early rendezvous opportunities. Future work will involve testing these protocols on physical Software Defined Radios (SDRs) to evaluate performance under real-world hardware constraints and synchronization challenges.

Summary updated

Abstract

In cognitive radio (CR) networks, "TTR", a.k.a. time-to-rendezvous, is one of the most important metrics for evaluating the performance of a channel hopping (CH) rendezvous protocol, and it characterizes the rendezvous delay when two CRs perform channel hopping. There exists a trade-off of optimizing the average or maximum TTR in the CH rendezvous protocol design. On one hand, the random CH protocol leads to the best "average" TTR without ensuring a finite "maximum" TTR (two CRs may never rendezvous in the worst case), or a high rendezvous diversity (multiple rendezvous channels). On the other hand, many sequence-based CH protocols ensure a finite maximum TTR (upper bound of TTR) and a high rendezvous diversity, while they inevitably yield a larger average TTR. In this paper, we strike a balance in the average-maximum TTR trade-off for CR rendezvous by leveraging the advantages of both random and sequence-based CH protocols. Inspired by the neighbor discovery problem, we establish a design framework of creating a wake-up schedule whereby every CR follows the sequence-based (or random) CH protocol in the awake (or asleep) mode. Analytical and simulation results show that the hybrid CH protocols under this framework are able to achieve a greatly improved average TTR as well as a low upper-bound of TTR, without sacrificing the rendezvous diversity.
BibTeX
@inproceedings{chen2015optimizing,
  author = {Lin Chen and Shuyu Shi and Kaigui Bian and Yusheng Ji},
  title = {{Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous}},
  booktitle = {ICC},
  year = {2015},
  url = {https://openreview.net/forum?id=vWaQVBLuYQu},
}
Figure