Guaranteed rendezvous for cognitive radio networks based on cycle length

Rendezvous is a blind process establishing a communication link on common channel between a pair of nodes in the cognitive radio networks. How to reach rendezvous efficiently and effectively is still an open problem. In this work, we propose a guaranteed rendezvous algorithm for cognitive radio networks, based on the prime cycle length. When the cycle lengths of the two nodes are coprime, the rendezvous is guaranteed in T<inf>i ∗</inf>T<inf>j</inf> +δ time slots, where Ti is the cycle length of node i and T<inf>j</inf> is that of node j. When T<inf>i</inf> = T<inf>j</inf>, combining with the deadlock checking and the binary ID of each node, each node will independently change its cycle length bit by bit, by which the rendezvous can still be guaranteed in T⁰ <inf>i</inf> ∗ T<inf>c</inf> + [log max{ID<inf>i</inf>, ID<inf>j</inf>}] ∗ (Ti⁰ ∗ Ti¹ + δ) time slots under all the possible time skew δ ∊ [O, Ti), where T<inf>c</inf> is some constant, and T⁰ and T¹ are two prime numbers defined for T<inf>i</inf>. We conduct simulations on three metrics to demonstrate the efficiency of the proposed method.