In cognitive radio networks, primary users have priority over the regulated radio spectrum. Secondary users may use residual air time. We focus on the problem of meeting on a common channel by a group of secondary users. The goal is to make the users rendezvous on a common channel in a minimum amount of time. The jump-stay algorithm has been created by Lin et al. to solve this problem. We construct a new analytic model for the two-user expected time to rendezvous in the jump-stay algorithm that better reflects its performance. For the sake of comparison, we also evaluate the performance of the jump-stay algorithm through simulation