Channel-Hopping Sequence and Searching Algorithm for Rendezvous of Spectrum Sensing
In this paper, we propose a method for applying the <i>p</i>-ary m-sequence as a channel-searching pattern for rendezvous in the asymmetric channel model of cognitive radio. We mathematically analyzed and calculated the ETTR when the m-sequence is applied to the conventional scheme, and...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/25/1/62 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we propose a method for applying the <i>p</i>-ary m-sequence as a channel-searching pattern for rendezvous in the asymmetric channel model of cognitive radio. We mathematically analyzed and calculated the ETTR when the m-sequence is applied to the conventional scheme, and our simulation results demonstrated that the ETTR performance is significantly better than that of the JS algorithm. Furthermore, we introduced a new channel-searching scheme that maximizes the benefits of the m-sequence and proposed a method to adapt the generation of the m-sequence for use in the newly proposed scheme. We also derived the ETTR mathematically for the new scheme with the m-sequence and showed through simulations that the performance of the new scheme with the m-sequence is superior to that of the conventional scheme with the m-sequence. Notably, when there is only one common channel, the new scheme with the m-sequence achieved approximately four times the improvement in the ETTR compared to the conventional scheme. |
|---|---|
| ISSN: | 1424-8220 |