Research On CRN-oriented Channel Rendezvous Technology

In the Cognitive Radio Network(CRN),any pair of users need to exchange data on a common channel.In the early research,the most common method was to use the Common Control Channel(CCC)in the CRN to achieve the intersection.However,CCC has inadequacies,such as the tendency to appear "single point",vulnerable to outside interference attacks,and unsuitable for dynamic network scenarios.Therefore,this paper will propose a crossover hopping algorithm for cognitive frequency hopping for the above problems.The specific research contents are as follows:In this paper,a new jump and wait for the hopping algorithm NJSRCH(A New Jump and Stay Rendezvous Channel-Hopping algorithm)is proposed in view of the problems existing in the current hopping frequency hopping algorithm,combined with the idea of arranging combinations in the GOS algorithm and the idea of hop-and-wait in the JS algorithm.Hopping algorithm).Then the theoretical analysis of NJSRCH algorithm is carried out,and the MTTR(Max Time To Rendezvous)and ATTR(Average Time To Rendezvous)are derived by means of mathematical induction and summarization.The performance of NJSRCH algorithm,GOS algorithm and JS algorithm on MTTR and ATTR are analyzed.The conclusion is that the performance of NJSRCH algorithm is better than GOS algorithm and JS algorithm.In order to improve the ability of NJSRCH algorithm to adapt to complex communication environment(anti-interference ability),this paper proposes an improved crossover algorithm based on genetic algorithm,namely E-NJSRCH(A New Enhanced Jump and Stay Rendezvous Channel-Hopping algorithm).Firstly,a new intersection frequency hopping solution is introduced and the theoretical basis of the hopping frequency hopping is briefly analyzed.Then,based on the relevant theories of genetic algorithm and the important parameters in the theory of hopping frequency hopping,the corresponding mathematical model is established,such as cognition.The success rate of hopping,ergodic probability and its expectation,average maximum traversal time;then simulation,observe the individual development trend,find the optimal solution;finally,derive the MTTR and ATTR of E-NJSRCH algorithm,and carry out with NJSRCH algorithm The comparison analysis shows that although the E-NJSRCH algorithm performs slightly worse than the NJSRCH algorithm on MTTR and ATTR,the E-NJSRCH algorithm is superior to the NJSRCH algorithm in environmental adaptability.Considering the actual communication environment,the E-NJSRCH algorithm is in line with the actual requirements.