Study of Channel-Replacement Algorithm in Cognitive Radio Networks

碩士 === 國立中興大學 === 通訊工程研究所 === 106 === Besides designing channel-hopping (CH) sequences with desirable characteristics, finding good methods of communication rendezvous is important for improving spectral efficiency and alleviating traffic load of cognitive radio (CR) networks. As secondary users can...

Full description

Bibliographic Details
Main Authors: Chih-Feng Chiang, 江志峰
Other Authors: 楊谷章
Format: Others
Language:en_US
Published: 2018
Online Access:http://ndltd.ncl.edu.tw/handle/bnd6an
Description
Summary:碩士 === 國立中興大學 === 通訊工程研究所 === 106 === Besides designing channel-hopping (CH) sequences with desirable characteristics, finding good methods of communication rendezvous is important for improving spectral efficiency and alleviating traffic load of cognitive radio (CR) networks. As secondary users cannot transmit in channels occupied by primary (licensed) users, some sort of channel-replacement methods to replace unavailable channels in CH sequences are needed. In this paper, a new channel-replacement method, which can maintain the channel-overlap, even-channel-use, and full-channel-use properties of the original CH sequences, is proposed and analyzed. Compared with previous works, the proposed channel-replacement method is better in various aspects, such as even-available-channel-use, channel diversity, and time-to-rendezvous, and can maintain a stable and uniform rendezvous process in the CR networks.