Guaranteed rendezvous for cognitive radio networks based on cycle length

Li Gou, Xiaohua Xu, Chongqing Zhang, Min Song

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Rendezvous is a blind process establishing a communication link on common channel between a pair of nodes in the cognitive radio networks. How to reach rendezvous efficiently and effectively is still an open problem. In this work, we propose a guaranteed rendezvous algorithm for cognitive radio networks, based on the prime cycle length. When the cycle lengths of the two nodes are coprime, the rendezvous is guaranteed in Ti ∗Tj +δ time slots, where Ti is the cycle length of node i and Tj is that of node j. When Ti = Tj, combining with the deadlock checking and the binary ID of each node, each node will independently change its cycle length bit by bit, by which the rendezvous can still be guaranteed in T0 i ∗ Tc + [log max{IDi, IDj}] ∗ (Ti0 ∗ Ti1 + δ) time slots under all the possible time skew δ [O, Ti), where Tc is some constant, and T0 and T1 are two prime numbers defined for Ti. We conduct simulations on three metrics to demonstrate the efficiency of the proposed method.

Original languageEnglish
Title of host publication2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
Pages1-6
Number of pages6
ISBN (Electronic)9781538645024
DOIs
StatePublished - 2 Jul 2017
Event2017 IEEE/CIC International Conference on Communications in China, ICCC 2017 - Qingdao, China
Duration: 22 Oct 201724 Oct 2017

Publication series

Name2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
Volume2018-January

Conference

Conference2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
Country/TerritoryChina
CityQingdao
Period22/10/1724/10/17

Fingerprint

Dive into the research topics of 'Guaranteed rendezvous for cognitive radio networks based on cycle length'. Together they form a unique fingerprint.

Cite this