A Probability-Based Fast Blind Rendezvous Channel-Hopping Algorithm in Cognitive Radio Sensor Networks

To solve the limitation of common control channel in cognitive radio sensor networks (CRSN), a simple and fast channel hopping algorithm SRA (sender-receiver-X) was proposed based on the traditional Rendezvous mechanism for reducing channel conflicts and improving the spectral adaptability of sensor nodes without using common control channels. In the SRA, node states were assorted into sending and receiving states firstly. And then, the channel hopping sequence was generated to realize the communication between nodes by adjusting the step size and the probability parameters. Finally, some theoretical and experimental analyses were carried out. Results show that, the algorithm can effectively solve the bottleneck problem of common control channel in CRSN, support symmetric and asymmetric models, satisfy multi-user/multi-hop application scenarios and realize guaranteed Rendezvous. Compared with other related algorithms, the SRPX algorithm is superior on maximum time to Rendezvous (MTTR) and average time to Rendezvous (ATTR).