Fast Multichannel Topology Discovery in Cognitive Radio Networks
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908337184964608 |
|---|---|
| author | Wang, Yung-Li Liu, Yiwei Chang, Cheng-Shang |
| author_facet | Wang, Yung-Li Liu, Yiwei Chang, Cheng-Shang |
| contents | In Cognitive Radio Networks (CRNs), secondary users (SUs) must efficiently discover each other across multiple communication channels while avoiding interference from primary users (PUs). Traditional multichannel rendezvous algorithms primarily focus on enabling pairs of SUs to find common channels without explicitly considering the underlying network topology. In this paper, we extend the rendezvous framework to explicitly incorporate network topology, introducing the \emph{multichannel topology discovery problem}. We propose a novel \emph{pseudo-random sweep algorithm with forward replacement}, designed to minimize correlation between consecutive unsuccessful rendezvous attempts, thereby significantly reducing the expected time-to-discovery (ETTD). Additionally, we introduce a \emph{threshold-based stick-together strategy} that dynamically synchronizes user hopping sequences based on partially known information, further enhancing discovery efficiency. Extensive simulation results validate our theoretical analysis, demonstrating that the proposed algorithms substantially outperform conventional (sequential) sweep methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_17818 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fast Multichannel Topology Discovery in Cognitive Radio Networks Wang, Yung-Li Liu, Yiwei Chang, Cheng-Shang Networking and Internet Architecture Distributed, Parallel, and Cluster Computing In Cognitive Radio Networks (CRNs), secondary users (SUs) must efficiently discover each other across multiple communication channels while avoiding interference from primary users (PUs). Traditional multichannel rendezvous algorithms primarily focus on enabling pairs of SUs to find common channels without explicitly considering the underlying network topology. In this paper, we extend the rendezvous framework to explicitly incorporate network topology, introducing the \emph{multichannel topology discovery problem}. We propose a novel \emph{pseudo-random sweep algorithm with forward replacement}, designed to minimize correlation between consecutive unsuccessful rendezvous attempts, thereby significantly reducing the expected time-to-discovery (ETTD). Additionally, we introduce a \emph{threshold-based stick-together strategy} that dynamically synchronizes user hopping sequences based on partially known information, further enhancing discovery efficiency. Extensive simulation results validate our theoretical analysis, demonstrating that the proposed algorithms substantially outperform conventional (sequential) sweep methods. |
| title | Fast Multichannel Topology Discovery in Cognitive Radio Networks |
| topic | Networking and Internet Architecture Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2504.17818 |