TY - GEN
T1 - Ring-walk based channel-hopping algorithms with guaranteed rendezvous for cognitive radio networks
AU - LIU, Hai
AU - Lin, Zhiyong
AU - CHU, Xiaowen
AU - LEUNG, Yiu Wing
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2010
Y1 - 2010
N2 - Rendezvous is a fundamental and essential operation for users of cognitive radio networks (CRNs) to meet and establish a link on a common channel, so that information exchange and data communication can be carried on. This work addresses the problem of blind rendezvous, i.e., rendezvous without the help of any central controller and dedicated common control channel. We propose two ring-walk (RW) based channel-hopping (CH) algorithms. The basic idea is to represent each channel as a vertex in a ring. Users "walk" on the ring by visiting vertices of channels with different velocities. Rendezvous is achievable since the user with lower velocity will eventually be "caught" by the user with higher velocity. Compared with the existing solutions, our algorithms achieve the following advances: i) guaranteed rendezvous without the need of time-synchronization; ii) applicability to rendezvous of multi-user and multi-hop scenarios. We derive the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithms in both 2-user and multi-user scenarios (shown in Table I). Simulation results show superior performance of our algorithms.
AB - Rendezvous is a fundamental and essential operation for users of cognitive radio networks (CRNs) to meet and establish a link on a common channel, so that information exchange and data communication can be carried on. This work addresses the problem of blind rendezvous, i.e., rendezvous without the help of any central controller and dedicated common control channel. We propose two ring-walk (RW) based channel-hopping (CH) algorithms. The basic idea is to represent each channel as a vertex in a ring. Users "walk" on the ring by visiting vertices of channels with different velocities. Rendezvous is achievable since the user with lower velocity will eventually be "caught" by the user with higher velocity. Compared with the existing solutions, our algorithms achieve the following advances: i) guaranteed rendezvous without the need of time-synchronization; ii) applicability to rendezvous of multi-user and multi-hop scenarios. We derive the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithms in both 2-user and multi-user scenarios (shown in Table I). Simulation results show superior performance of our algorithms.
KW - Channel hopping
KW - Cognitive radio
KW - Rendezvous
UR - http://www.scopus.com/inward/record.url?scp=79953093574&partnerID=8YFLogxK
U2 - 10.1109/GreenCom-CPSCom.2010.30
DO - 10.1109/GreenCom-CPSCom.2010.30
M3 - Conference proceeding
AN - SCOPUS:79953093574
SN - 9780769543314
T3 - Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010
SP - 755
EP - 760
BT - Proceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010
T2 - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010
Y2 - 18 December 2010 through 20 December 2010
ER -