Enhanced jump-stay rendezvous algorithm for cognitive radio networks

Rendezvous is a fundamental operation for cognitive users to establish communication links. In [5], we proposed a jump-stay (JS) rendezvous algorithm which was shown to have the overall best performance. In this work, we propose an enhanced jump-stay (EJS) algorithm. Compared with JS, EJS lowers the upper-bounds of both the maximum time-to-rendezvous (MTTR) and the expected time-to-rendezvous (E(TTR)) from O(P^{3}) to O(P^{2}) under the asymmetric model, while keeping the same order O(P) of upper-bounds of MTTR and E(TTR) under the symmetric mode, where P is the smallest prime number greater than the total number of channels.