Research On Control Channel Rendezvous Algorithms For Cognitive Radio Networks

The improving and developing cognitive radio technologies, will bring revolutionary change to the current dilemma between the shortage and the low utility for wireless communication spectrum resource. At the same time, the application of cognitive radio technology in the field of military communication will greatly strengthen the spectrum resource management and the ability of anti-jamming communication.The core idea of cognitive radio technology is dynamic spectrum access. Andrendezvous algorithm(also known as neighbor discovery or handshake algorithm) is one of key technologies in the designing a MAC protocol for cognitive radio networks. And our work is mainly focusing on the rendezvous algorithms based on channel hopping sequences for distributed asynchronous cognitive radio networks.In the thesis, firstly we introduce the key technology of dynamic spectrum access and multi-channel blind rendezvous techniques in cognitive radio. Then we describe and analyze the rendezvous algorithms that are suitable for distributed, asynchronous network. Finally, foucsing on channel hopping sequence based rendezvous algorithms, a detailed and orignal research is discussed.In chapter two, we described and analyed the multi-channel asynchronous rendezvous algorithms which were relatively representative in latest literature. At the same time, the performance of these algorithms and QBAP algorithm on ETTR, MTTR, Fairness and Robustness is simulated and verified.We study the application of the difference set theory and cyclic quorum theory in the construction of channel hopping sequences. Then we put forward the conclusion and verified that all channel hopping sequences that are used in the process of multi-channel asynchronous blind rendezvous in ACHRS are fundamentally based on difference set. And then we propose a scheme to construct the shortest channel hopping sequence using difference sets that are mutually disjoint, namely DBCC(Difference-set Based Channel hopping sequence Construction) algorithm, and its core idea is to propose an efficient scheme to find out the required difference sets using prime number as difference set multiplier.Then, on the basis of difference set theory, we put forward the QBAP(Quorum Based A&P channel hopping sequence) rendezvous algorithm. We proved that the A&P sequences constructed through QBAP algorithm are shortest, as well as outperm other algorithms on ETTR and MTTR.In chapter five, we design a time slot structure that can guarantee a successful rendezvous in asynchronous system. In a simulated network scenario, we verified the performance of this time slot structure and the QBAP algorithm used in the process of rendezvous.