Construction and Analysis of Channel-Hopping Sequence Based on Criss-Cross Algorithm and Algebraic Algorithm for Cognitive Radio Networks
| Autor: | Ming-Chia Yao, 姚明佳 |
|---|---|
| Rok vydání: | 2019 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 107 In this thesis, we constructed two families of synchronous-symmetric channel-hopping (CH) sequences for cognitive radio networks. First, a novel “criss-cross-pattern” method of constructing synchronous-symmetric channel-hopping sequences is introduced. This simplified and improved construction can work with any number of licensed channels. Second, an algebraic construction of synchronous-symmetric channel-hopping sequences for cognitive radio networks is proposed. Both of this two sequences carries desirable properties including enlarged cardinality, full degree-of-rendezvous, optimal maximum-time-to-rendezvous, and even channel use. They also achieves “full channel utilization per time slot” so that multiple pairs of users can rendezvous using all licensed channels in all time slots without channel collisions. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|