An improved fair channel hopping protocol for dynamic environments in cognitive radio networks

Rendezvous is a fundamental challenge in cognitive radio networks where users can find each other on a specific channel and hence establish a communication link. Most previous works are based on the strong assumption that users are able to find a set of available channels after the spectrum sensing stage and the status of these channels are stable all the time, which, however, may be unrealistic in some scenarios. As a solution, we design a fair channel hopping protocol with dynamic channel state, by adopting the concepts of Markov process, Jenkins Hash and Josephus recursive. Two protocols (FCH_S, FCH_A) are proposed for synchronous clock and asynchronous clock network model, respectively. The channel activity model is built with the aid of Markov process. By taking advantage of Jenkins Hash and Josephus recursive, the fairness of protocol is guaranteed. We assume that (1) a secondary user, SUA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_A$$\end{document}, rendezvous with SUB\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_B$$\end{document}; (2) corresponding channels available probability are pa\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p_a$$\end{document} and pb\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p_b$$\end{document}. According to these assumptions, we can prove that expect rendezvous time for FCH_S and FCH_A are 1papb\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\dfrac{1}{p_{a}p_{b}}$$\end{document} and 1pa+1pb-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\dfrac{1}{p_{a}}+\dfrac{1}{p_{b}}-1$$\end{document}. Simulation results demonstrate that FCH_S and FCH_A can achieve better performance in contrast to the exiting channel hopping protocols (e.g. H.Tan and HHCH).