Improved rendezvous algorithms for heterogeneous cognitive radio networks

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Annual Joint Conference of the IEEE Computer and Communications Societies s. 154 - 162
Hlavní autori: Zhaoquan Gu, Haosen Pu, Qiang-Sheng Hua, Lau, Francis C. M.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.04.2015
Predmet:
Algorithm design and analysis
Cognitive radio
Computers
Conferences
Fully available spectrum
Heterogeneous Cognitive Radio Network
Partially available spectrum
Rendezvous
Sensors
Wireless sensor networks
ISSN:0743-166X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 C i ⊆ U and the set of available channels (i.e. the channels not occupied by the paying users) as V i ⊆ C i . We study the rendezvous problem in HCRN under two circumstances: fully available spectrum (V i = C i ) and partially available spectrum (V i ≠ C i ). For any two users a, b, we propose the Traversing Pointer (TP) algorithm that guarantees rendezvous in O(max{|C a |,|C b |}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{|C a |, |C b |}) factor as compared to the state-of-the-art result (O(|C a ||C b |) in [26]). For the partially available spectrum scenario, we propose the Moving Traversing Pointers (MTP) algorithm to guarantee rendezvous in O((max{|V a |, |V b |}) 2 log log n) time slots, which works more efficiently than the previous best result (O(|C a ||C b |) in [25]) in various circumstances. We also conduct extensive simulations and the results corroborate our analysis.
ISSN:0743-166X
DOI:10.1109/INFOCOM.2015.7218378