Guaranteed rendezvous for cognitive radio networks based on cycle length

Guaranteed Rendezvous for Cognitive Radio Networks Based on Cycle Length

“…T i >= T j . The simulations are conducted in 2-node scenario, and the available channels of the two nodes are randomly selected from [1,100]. The common channels between them are also randomly selected from their available channel set.…”

“…During the simulation, the channels are all randomly assigned with IDs from [1,100]. Such as, the asymmetric algorithm proposed in [10], and the asymmetric model based ring-walk channel hopping algorithm proposed in [20].…”