EUVIMEDEUVIMED entdecken
Crossref

Oblivious Rendezvous for Heterogeneous Cognitive Radio Networks Based on Partially Anonymous Channel Hopping

Xuesong Jonathan Tan, Yixuan Tan, Yunzhi Zhen, Renting Liu

IEEE Transactions on Cognitive Communications and Networking · 2026 · 12 · 2690-2707

DOI: 10.1109/tccn.2025.3584938 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Cognitive Communications and Networking, 2026. Verfasst von Xuesong Jonathan Tan und 3 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 50 Literaturangaben. Gefördert von: National Key Laboratory of Wireless Communications Foundation, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

To exchange control information robustly, cognitive users (CUs) can perform channel hopping (CH) for achieving rendezvous in the blind fashion. In practice, various constraints of CUs, e.g., asynchronous time clock, heterogeneous available channels, different radio numbers, different channel labelling schemes, and the need of hiding its identifiers (IDs), may obstruct their rendezvous process. To cope with these constraints as holistic as possible, the present paper proposes a partially anonymous CH scheme for asynchronous CUs with heterogeneous available channels and different radio numbers to achieve oblivious rendezvous within a limited time. To our best knowledge, the proposed scheme is the first known one that can support multi-radio CUs to rendezvous obliviously with single-radio ones. Different from many existing CH schemes that choose two prime numbers at each CU, each of which can be factorized into the number 1 and itself only, our scheme selects one prime only for each CU to generate its CH sequences appropriately. Through this way, any two CUs selecting different primes will be guaranteed to rendezvous obliviously by the Chinese Remainder theorem and those with a common prime by another algebraic theorem, regardless of their radio numbers. Compared with the state-of-the-art ones that can handle with part of the aforementioned constraints only, the proposed CH scheme incurs one key performance metrics, i.e., maximum time-to-rendezvous (MTTR), at the same order and can achieve a shorter MTTR between multi- and single-radio CUs at the cost of sacrificing slightly the MTTR performance between single-radio CUs.

Förderung

  • National Key Laboratory of Wireless Communications Foundation
  • National Natural Science Foundation of China

Zitieren

APA

Tan, X. J., Tan, Y., Zhen, Y., & Liu, R. (2026). Oblivious Rendezvous for Heterogeneous Cognitive Radio Networks Based on Partially Anonymous Channel Hopping. IEEE Transactions on Cognitive Communications and Networking, 12, 2690-2707. https://doi.org/10.1109/tccn.2025.3584938

Vancouver

Tan XJ, Tan Y, Zhen Y, Liu R. Oblivious Rendezvous for Heterogeneous Cognitive Radio Networks Based on Partially Anonymous Channel Hopping. IEEE Transactions on Cognitive Communications and Networking. 2026;12:2690-2707. doi:10.1109/tccn.2025.3584938

BibTeX
@article{Tan2026,
  author = {Tan, Xuesong Jonathan and Tan, Yixuan and Zhen, Yunzhi and Liu, Renting},
  title = {Oblivious Rendezvous for Heterogeneous Cognitive Radio Networks Based on Partially Anonymous Channel Hopping},
  journal = {IEEE Transactions on Cognitive Communications and Networking},
  year = {2026},
  volume = {12},
  pages = {2690--2707},
  doi = {10.1109/tccn.2025.3584938}
}
Kostenlos starten →