Ring-walk based channel-hopping algorithms with guaranteed rendezvous for cognitive radio networks

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

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

77 Citations (Scopus)

Abstract

Rendezvous is a fundamental and essential operation for users of cognitive radio networks (CRNs) to meet and establish a link on a common channel, so that information exchange and data communication can be carried on. This work addresses the problem of blind rendezvous, i.e., rendezvous without the help of any central controller and dedicated common control channel. We propose two ring-walk (RW) based channel-hopping (CH) algorithms. The basic idea is to represent each channel as a vertex in a ring. Users "walk" on the ring by visiting vertices of channels with different velocities. Rendezvous is achievable since the user with lower velocity will eventually be "caught" by the user with higher velocity. Compared with the existing solutions, our algorithms achieve the following advances: i) guaranteed rendezvous without the need of time-synchronization; ii) applicability to rendezvous of multi-user and multi-hop scenarios. We derive the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithms in both 2-user and multi-user scenarios (shown in Table I). Simulation results show superior performance of our algorithms.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010
Pages755-760
Number of pages6
DOIs
Publication statusPublished - 2010
Event2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010 - Hangzhou, China
Duration: 18 Dec 201020 Dec 2010

Publication series

NameProceedings - 2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010

Conference

Conference2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010
Country/TerritoryChina
CityHangzhou
Period18/12/1020/12/10

Scopus Subject Areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

User-Defined Keywords

  • Channel hopping
  • Cognitive radio
  • Rendezvous

Fingerprint

Dive into the research topics of 'Ring-walk based channel-hopping algorithms with guaranteed rendezvous for cognitive radio networks'. Together they form a unique fingerprint.

Cite this