TY - JOUR
T1 - Guaranteed rendezvous algorithms for cognitive radio networks
AU - Gou, Li
AU - Xu, Xiaohua
AU - Zhang, Chongqing
AU - Song, Min
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2018/5
Y1 - 2018/5
N2 - Rendezvous is a blind process establishing a communication link on a common channel between a pair of nodes in cognitive radio networks. We propose two guaranteed rendezvous algorithms for cognitive radio networks under both single-radio and multi-radio scenarios with an asynchronous setting. For single-radio scenario, each cycle length is a prime number associated with a channel hopping sequence. The rendezvous can be guaranteed as long as the IDs of the two nodes are different. For multi-radio scenario, we propose a cycle length and rotation based rendezvous algorithm. Each node generates a channel hopping sequence with only one cycle length. Then these radios of each nodes rotate on the generated sequence with different rotation numbers at each hopping cycle. The rendezvous between two nodes is guaranteed as long as they have different cycle lengths or the same cycle length with different number of rotations. We conduct simulations on three metrics and the results show that the proposed algorithms outperform the existing ones.
AB - Rendezvous is a blind process establishing a communication link on a common channel between a pair of nodes in cognitive radio networks. We propose two guaranteed rendezvous algorithms for cognitive radio networks under both single-radio and multi-radio scenarios with an asynchronous setting. For single-radio scenario, each cycle length is a prime number associated with a channel hopping sequence. The rendezvous can be guaranteed as long as the IDs of the two nodes are different. For multi-radio scenario, we propose a cycle length and rotation based rendezvous algorithm. Each node generates a channel hopping sequence with only one cycle length. Then these radios of each nodes rotate on the generated sequence with different rotation numbers at each hopping cycle. The rendezvous between two nodes is guaranteed as long as they have different cycle lengths or the same cycle length with different number of rotations. We conduct simulations on three metrics and the results show that the proposed algorithms outperform the existing ones.
KW - blind rendezvous
KW - channel hopping
KW - cognitive radio networks
KW - cycle length
UR - http://www.scopus.com/inward/record.url?scp=85049103821&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049103821&partnerID=8YFLogxK
U2 - 10.1109/CC.2018.8387991
DO - 10.1109/CC.2018.8387991
M3 - Article
AN - SCOPUS:85049103821
SN - 1673-5447
VL - 15
SP - 111
EP - 127
JO - China Communications
JF - China Communications
IS - 5
ER -