Cognitive radio technology has shown tremendous potential through its spectrum access mechanism for reducing spectrum paucity. With the vacant spectrum, two nodes require consensus for common channel in an apposite time. However, in a non-centralized distributed communication system, the task of attaining one common channel for two nodes is not tractable. In this letter, we attend to a well-known technique for rendezvous in such a cognitive radio network and analytically characterize the performance. The statistical distribution of rendezvous time to obtain common channel is analyzed and a closed form expression is derived. Using the distribution, we further analyze the mean and maximum rendezvous times and moreover propose an improvement in the considered technique. The theoretical analyses are verified using Monte–Carlo simulations and our results show a very precise match between the two.