Taxonomy and challenges of rendezvous algorithms in cognitive radio networks

Hai LIU; Zhiyong Lin; Xiaowen CHU; Yiu Wing LEUNG

doi:10.1109/ICCNC.2012.6167502

Taxonomy and challenges of rendezvous algorithms in cognitive radio networks

Hai LIU^*, Zhiyong Lin, Xiaowen CHU, Yiu Wing LEUNG

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

48 Citations (Scopus)

Abstract

Cognitive radio network (CRN) is a new networking paradigm in which unlicensed users with cognitive radios can opportunistically access idle channels in the spectrum of licensed users without causing interference. Rendezvous is a fundamental and essential operation for unlicensed users to meet and establish a communication link on a common channel, so that information exchange and data communication can be carried out. This article presents a comprehensive review of existing rendezvous algorithms and a possible taxonomy. We focus on the most representative rendezvous algorithms and summarize their characteristics. The article further highlights research directions of future study on rendezvous.

Original language	English
Title of host publication	2012 International Conference on Computing, Networking and Communications, ICNC'12
Pages	645-649
Number of pages	5
DOIs	https://doi.org/10.1109/ICCNC.2012.6167502
Publication status	Published - 2012
Event	2012 International Conference on Computing, Networking and Communications, ICNC'12 - Maui, HI, United States Duration: 30 Jan 2012 → 2 Feb 2012

Publication series

Name	2012 International Conference on Computing, Networking and Communications, ICNC'12

Conference

Conference	2012 International Conference on Computing, Networking and Communications, ICNC'12
Country/Territory	United States
City	Maui, HI
Period	30/01/12 → 2/02/12

Scopus Subject Areas

Computer Networks and Communications
Electrical and Electronic Engineering

User-Defined Keywords

channel hopping
cognitive radios
rendezvous

Access to Document

10.1109/ICCNC.2012.6167502

Cite this

LIU, H., Lin, Z., CHU, X., & LEUNG, Y. W. (2012). Taxonomy and challenges of rendezvous algorithms in cognitive radio networks. In 2012 International Conference on Computing, Networking and Communications, ICNC'12 (pp. 645-649). Article 6167502 (2012 International Conference on Computing, Networking and Communications, ICNC'12). https://doi.org/10.1109/ICCNC.2012.6167502

@inproceedings{abc139c4570d4a8c9a9471adef502f3a,

title = "Taxonomy and challenges of rendezvous algorithms in cognitive radio networks",

abstract = "Cognitive radio network (CRN) is a new networking paradigm in which unlicensed users with cognitive radios can opportunistically access idle channels in the spectrum of licensed users without causing interference. Rendezvous is a fundamental and essential operation for unlicensed users to meet and establish a communication link on a common channel, so that information exchange and data communication can be carried out. This article presents a comprehensive review of existing rendezvous algorithms and a possible taxonomy. We focus on the most representative rendezvous algorithms and summarize their characteristics. The article further highlights research directions of future study on rendezvous.",

keywords = "channel hopping, cognitive radios, rendezvous",

author = "Hai LIU and Zhiyong Lin and Xiaowen CHU and LEUNG, {Yiu Wing}",

note = "Copyright: Copyright 2012 Elsevier B.V., All rights reserved.; 2012 International Conference on Computing, Networking and Communications, ICNC'12 ; Conference date: 30-01-2012 Through 02-02-2012",

year = "2012",

doi = "10.1109/ICCNC.2012.6167502",

language = "English",

isbn = "9781467300094",

series = "2012 International Conference on Computing, Networking and Communications, ICNC'12",

pages = "645--649",

booktitle = "2012 International Conference on Computing, Networking and Communications, ICNC'12",

}

LIU, H, Lin, Z, CHU, X & LEUNG, YW 2012, Taxonomy and challenges of rendezvous algorithms in cognitive radio networks. in 2012 International Conference on Computing, Networking and Communications, ICNC'12., 6167502, 2012 International Conference on Computing, Networking and Communications, ICNC'12, pp. 645-649, 2012 International Conference on Computing, Networking and Communications, ICNC'12, Maui, HI, United States, 30/01/12. https://doi.org/10.1109/ICCNC.2012.6167502

Taxonomy and challenges of rendezvous algorithms in cognitive radio networks. / LIU, Hai; Lin, Zhiyong; CHU, Xiaowen et al.
2012 International Conference on Computing, Networking and Communications, ICNC'12. 2012. p. 645-649 6167502 (2012 International Conference on Computing, Networking and Communications, ICNC'12).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Taxonomy and challenges of rendezvous algorithms in cognitive radio networks

AU - LIU, Hai

AU - Lin, Zhiyong

AU - CHU, Xiaowen

AU - LEUNG, Yiu Wing

PY - 2012

Y1 - 2012

N2 - Cognitive radio network (CRN) is a new networking paradigm in which unlicensed users with cognitive radios can opportunistically access idle channels in the spectrum of licensed users without causing interference. Rendezvous is a fundamental and essential operation for unlicensed users to meet and establish a communication link on a common channel, so that information exchange and data communication can be carried out. This article presents a comprehensive review of existing rendezvous algorithms and a possible taxonomy. We focus on the most representative rendezvous algorithms and summarize their characteristics. The article further highlights research directions of future study on rendezvous.

AB - Cognitive radio network (CRN) is a new networking paradigm in which unlicensed users with cognitive radios can opportunistically access idle channels in the spectrum of licensed users without causing interference. Rendezvous is a fundamental and essential operation for unlicensed users to meet and establish a communication link on a common channel, so that information exchange and data communication can be carried out. This article presents a comprehensive review of existing rendezvous algorithms and a possible taxonomy. We focus on the most representative rendezvous algorithms and summarize their characteristics. The article further highlights research directions of future study on rendezvous.

KW - channel hopping

KW - cognitive radios

KW - rendezvous

UR - http://www.scopus.com/inward/record.url?scp=84859886419&partnerID=8YFLogxK

U2 - 10.1109/ICCNC.2012.6167502

DO - 10.1109/ICCNC.2012.6167502

M3 - Conference proceeding

AN - SCOPUS:84859886419

SN - 9781467300094

T3 - 2012 International Conference on Computing, Networking and Communications, ICNC'12

SP - 645

EP - 649

BT - 2012 International Conference on Computing, Networking and Communications, ICNC'12

T2 - 2012 International Conference on Computing, Networking and Communications, ICNC'12

Y2 - 30 January 2012 through 2 February 2012

ER -

Taxonomy and challenges of rendezvous algorithms in cognitive radio networks

Abstract

Publication series

Conference

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this