Enhanced Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks

Abstract

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 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> ) to O(P <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) 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.