TY - GEN
T1 - Cooperative rendezvous protocol for multiple user-pairs in cognitive radio networks
AU - Yu, Lu
AU - Liu, Hai
AU - LEUNG, Yiu Wing
AU - CHU, Xiaowen
AU - Lin, Zhiyong
N1 - Funding Information:
ACKNOWLEDGMENT This project is partly supported by the Strategic Development Fund of the Hong Kong Baptist University. Hai Liu is supported by Research Grant of Hong Kong (Faculty Development Scheme No. UGC/FDS14/E01/17). Zhiyong Lin is supported by the National Natural Science Foundation of China (No. 61202453), the Natural Science Foundation of Guangdong Province in China (No. 2015A030310394), and the Science and Technology Program of Guangzhou in China (No.201704030133).
PY - 2018/6/8
Y1 - 2018/6/8
N2 - In cognitive radio networks, rendezvous is a fundamental operation by which cognitive users establish communication links. Most of existing works consider rendezvous of a pair of users. When multiple pairs of users are doing rendezvous, collisions are caused by the multiple user-pairs which significantly degrade the rendezvous performance, e.g., resulting in a long time-to-rendezvous. To address this problem, we propose a new protocol called Cooperative Rendezvous Protocol which exploits cooperation in the multiple user-pairs environment to speed up the rendezvous operation. Using this protocol, multiple user-pairs cooperate with each other to relay their channel availability information, so that they could avoid attempting rendezvous in unavailable channels. The proposed protocol serves as a general framework that can be applied in conjunction with any existing rendezvous algorithm for faster rendezvous. We theoretically derive an upper bound on the time-to-rendezvous when the proposed protocol is applied in conjunction with any rendezvous algorithm which generates channel hopping sequence based on the available channel set. In addition, we conduct extensive simulation and the results show that the proposed protocol can significantly reduce the time-to-rendezvous of the existing rendezvous algorithms by up to 80.86% in multiple user-pairs environment.
AB - In cognitive radio networks, rendezvous is a fundamental operation by which cognitive users establish communication links. Most of existing works consider rendezvous of a pair of users. When multiple pairs of users are doing rendezvous, collisions are caused by the multiple user-pairs which significantly degrade the rendezvous performance, e.g., resulting in a long time-to-rendezvous. To address this problem, we propose a new protocol called Cooperative Rendezvous Protocol which exploits cooperation in the multiple user-pairs environment to speed up the rendezvous operation. Using this protocol, multiple user-pairs cooperate with each other to relay their channel availability information, so that they could avoid attempting rendezvous in unavailable channels. The proposed protocol serves as a general framework that can be applied in conjunction with any existing rendezvous algorithm for faster rendezvous. We theoretically derive an upper bound on the time-to-rendezvous when the proposed protocol is applied in conjunction with any rendezvous algorithm which generates channel hopping sequence based on the available channel set. In addition, we conduct extensive simulation and the results show that the proposed protocol can significantly reduce the time-to-rendezvous of the existing rendezvous algorithms by up to 80.86% in multiple user-pairs environment.
KW - Channel hopping
KW - Cognitive radio networks
KW - Collision
KW - Cooperative protocol
UR - http://www.scopus.com/inward/record.url?scp=85049193153&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2018.8377135
DO - 10.1109/WCNC.2018.8377135
M3 - Conference proceeding
AN - SCOPUS:85049193153
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 1
EP - 6
BT - 2018 IEEE Wireless Communications and Networking Conference, WCNC 2018
PB - IEEE
T2 - 2018 IEEE Wireless Communications and Networking Conference, WCNC 2018
Y2 - 15 April 2018 through 18 April 2018
ER -