On Heterogeneous Sensing Capability for Distributed Rendezvous in Cognitive Radio Networks

• Published in: IEEE transactions on mobile computing 2021-11, Vol.20 (11), p.3211-3226
• Main Authors: Gu, Zhaoquan, Wang, Yuexuan, Shen, Tong, Lau, Francis C.M.
• Format: Magazinearticle
• Language: English
• Subjects: Algorithms; Channels; Cognitive radio; Cognitive radio network; distributed algorithm; Electronic mail; heterogeneous sensing capability; Lower bounds; Mobile computing; Prime numbers; Radio networks; rendezvous; Sensors; Wireless sensor networks
• ISSN: 1536-1233; 1558-0660
• DOI: 10.1109/TMC.2020.2997077

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 to as rendezvous . In reality, the capability to sense the spectrum may vary from user to user. We study distributed rendezvous for heterogeneous sensing capabilities in this paper. The licensed spectrum is divided into n n channels, U = \lbrace 1,2,\ldots,n\rbrace U={1,2,...,n} . We denote the sensing capability of user i i as C_i \subseteq U Ci⊆U and the set of available channels (i.e., the channels not occupied by paying users) as V_i \subseteq C_i Vi⊆Ci . Due to hardware differences, the users may have different sensing capabilities: C_i \ne C_j Ci≠Cj , and this is called heterogeneous sensing capability . In this paper, we propose efficient algorithms for two scenarios: the fully available scenario where V_i = C_i