TY - GEN
T1 - Improved rendezvous algorithms for heterogeneous cognitive radio networks
AU - Gu, Zhaoquan
AU - Pu, Haosen
AU - Hua, Qiang Sheng
AU - Lau, Francis C.M.
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/8/21
Y1 - 2015/8/21
N2 - Cognitive radio networks (CRNs) have been proposed to solve the spectrum scarcity problem. One of their fundamental procedures is to construct a communication link on a common channel for the users, which is referred as rendezvous. In reality, the capability to sense the spectrum may vary from user to user, and such users form what is known as a heterogeneous cognitive radio network (HCRN). The licensed spectrum is divided in to n channels, U = {1, 2,..., n}. We denote the capability of user i as Ci E U and the set of available channels (i.e. the channels not occupied by the paying users) as Vi E Ci. We study the rendezvous problem in HCRN under two circumstances: fully available spectrum (Vi = Ci) and partially available spectrum (Vi ≠ Ci). For any two users a, b, we propose the Traversing Pointer (TP) algorithm that guarantees rendezvous in O(max{CaCb}log log n) time slots for the fully available spectrum scenario. This result is only O (log log n) larger than our constructive lower bound. Moreover, it removes an O(min{Ca, Cb}) factor as compared to the state-of-the-art result (O(CaCb) in [26]). For the partially available spectrum scenario, we propose the Moving Traversing Pointers (MTP) algorithm to guarantee rendezvous in O((max{Va, Vb})2 log log n) time slots, which works more efficiently than the previous best result (O(CaCb) in [25]) in various circumstances. We also conduct extensive simulations and the results corroborate our analysis.
AB - Cognitive radio networks (CRNs) have been proposed to solve the spectrum scarcity problem. One of their fundamental procedures is to construct a communication link on a common channel for the users, which is referred as rendezvous. In reality, the capability to sense the spectrum may vary from user to user, and such users form what is known as a heterogeneous cognitive radio network (HCRN). The licensed spectrum is divided in to n channels, U = {1, 2,..., n}. We denote the capability of user i as Ci E U and the set of available channels (i.e. the channels not occupied by the paying users) as Vi E Ci. We study the rendezvous problem in HCRN under two circumstances: fully available spectrum (Vi = Ci) and partially available spectrum (Vi ≠ Ci). For any two users a, b, we propose the Traversing Pointer (TP) algorithm that guarantees rendezvous in O(max{CaCb}log log n) time slots for the fully available spectrum scenario. This result is only O (log log n) larger than our constructive lower bound. Moreover, it removes an O(min{Ca, Cb}) factor as compared to the state-of-the-art result (O(CaCb) in [26]). For the partially available spectrum scenario, we propose the Moving Traversing Pointers (MTP) algorithm to guarantee rendezvous in O((max{Va, Vb})2 log log n) time slots, which works more efficiently than the previous best result (O(CaCb) in [25]) in various circumstances. We also conduct extensive simulations and the results corroborate our analysis.
KW - Fully available spectrum
KW - Heterogeneous Cognitive Radio Network
KW - Partially available spectrum
KW - Rendezvous
UR - https://www.scopus.com/pages/publications/84954206489
U2 - 10.1109/INFOCOM.2015.7218378
DO - 10.1109/INFOCOM.2015.7218378
M3 - 会议稿件
AN - SCOPUS:84954206489
T3 - Proceedings - IEEE INFOCOM
SP - 154
EP - 162
BT - 2015 IEEE Conference on Computer Communications, IEEE INFOCOM 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015
Y2 - 26 April 2015 through 1 May 2015
ER -