Probabilistic path selection in opportunistic cognitive radio networks

Hicham Khalife, Satyajeet Ahuja, Naceur Malouch, Marwan Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

98 Scopus citations

Abstract

We present a novel routing approach for multichannel cognitive radio networks (CRNs). Our approach is based on probabilistically estimating the available capacity of every channel over every CR-to-CR link, while taking into account primary radio (PR). Our routing design consists of two main phases. In the first phase, the source node attempts to compute the most probable path (MPP) to the destination (including the channel assignment along that path) whose bandwidth has the highest probability of satisfying a required demand D.Inthe second phase, we verify whether the capacity of the MPP is indeed sufficient to meet the demand at confidence level S.If that is not the case, we judiciously add channels to the links of the MPP such that the augmented MPP satisfies the demand D at the confidence level 5. We show through simulations that our protocol always finds the best path to the destination, achieving in some cases up to 200% improvement in connection acceptance rate compared to the traditional Dijkstra.

Original languageEnglish (US)
Title of host publication2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Pages4861-4865
Number of pages5
DOIs
StatePublished - Dec 1 2008
Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States
Duration: Nov 30 2008Dec 4 2008

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Country/TerritoryUnited States
CityNew Orleans, LA
Period11/30/0812/4/08

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Probabilistic path selection in opportunistic cognitive radio networks'. Together they form a unique fingerprint.

Cite this