TY - GEN
T1 - Deterministic distributed rendezvous algorithms for multi-radio Cognitive Radio Networks
AU - Li, Guyue
AU - Gu, Zhaoquan
AU - Lin, Xiao
AU - Pu, Haosen
AU - Hua, Qiang Sheng
PY - 2014
Y1 - 2014
N2 - Rendezvous is a fundamental process in constructing Cognitive Radio Networks (CRNs), through which the user can communicate with its neighbors by establishing a link on some licensed frequency band (channel). Most of the existing elegant rendezvous algorithms assume each user is equipped with a single radio. Nowadays the multi-radio cognitive radio architecture, where each user can access k ≥ 2 channels at the same time, has become a reality. In this paper, we study the rendezvous problem in multi-radio CRN to see whether and to what extent the multi-radio capability can improve the rendezvous performance. To begin with, we propose a family of deterministic distributed algorithms for two special situations when k = 2 and k = O( √ n), where n is the number of all channels. These algorithms show that the maximum time to rendezvous (MTTR) can be reduced (largely) in multi-radio CRN. Then we derive a lower bound of MTTR as Ω( |Vi ||Vj |/k2 ) for arbitrary k (Vi, Vj represents two users' available channel sets) and present a distributed algorithm to guarantee rendezvous in O( |Vi ||Vj |/k2 ) time slots, which meets the lower bound. Extensive simulations are conducted to corroborate our theoretical analyses.
AB - Rendezvous is a fundamental process in constructing Cognitive Radio Networks (CRNs), through which the user can communicate with its neighbors by establishing a link on some licensed frequency band (channel). Most of the existing elegant rendezvous algorithms assume each user is equipped with a single radio. Nowadays the multi-radio cognitive radio architecture, where each user can access k ≥ 2 channels at the same time, has become a reality. In this paper, we study the rendezvous problem in multi-radio CRN to see whether and to what extent the multi-radio capability can improve the rendezvous performance. To begin with, we propose a family of deterministic distributed algorithms for two special situations when k = 2 and k = O( √ n), where n is the number of all channels. These algorithms show that the maximum time to rendezvous (MTTR) can be reduced (largely) in multi-radio CRN. Then we derive a lower bound of MTTR as Ω( |Vi ||Vj |/k2 ) for arbitrary k (Vi, Vj represents two users' available channel sets) and present a distributed algorithm to guarantee rendezvous in O( |Vi ||Vj |/k2 ) time slots, which meets the lower bound. Extensive simulations are conducted to corroborate our theoretical analyses.
KW - Cognitive radio network
KW - Multi-Radio
KW - Rendezvous
UR - https://www.scopus.com/pages/publications/84908650047
U2 - 10.1145/2641798.2641827
DO - 10.1145/2641798.2641827
M3 - 会议稿件
AN - SCOPUS:84908650047
T3 - MSWiM 2014 - Proceedings of the 17th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
SP - 313
EP - 320
BT - MSWiM 2014 - Proceedings of the 17th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
PB - Association for Computing Machinery, Inc
T2 - 17th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2014
Y2 - 21 September 2014 through 26 September 2014
ER -