Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks

Yuan Le, Xiuzhen Cheng, Dechang Chen, Nan Zhang, Taieb Znati, Mznah A. Al-Rodhaan, Abdullah Al-Dhelaan

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A challenging problem in cognitive radio networks (CRNs) is to design a throughput efficient routing and scheduling algorithm for end-to-end communications between secondary users (SUs) in a distributed manner. Due to the opportunistic nature of CRN routing, we consider a framework with randomized path selection in this paper. Motivated by the back-pressure scheduling policy, we adopt the differential queue backlog as the routing metric to achieve throughput efficiency. Moreover, we demonstrate the sufficient condition for our framework to achieve throughput optimality by analyzing the Lyapunov drift. We further propose a distributed medium access control algorithm that can approximately satisfy the required condition when the transmission attempt probability is low. The performance of our proposed scheme is evaluated in a simulation platform, and the evaluation results verify the effectiveness of our distributed scheme.

Original languageEnglish (US)
JournalEurasip Journal on Wireless Communications and Networking
Volume2015
Issue number1
DOIs
StatePublished - Dec 1 2015

Fingerprint

Cognitive radio
Scheduling
Throughput
Network routing
Medium access control
Routing algorithms
Scheduling algorithms
Communication

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Le, Yuan ; Cheng, Xiuzhen ; Chen, Dechang ; Zhang, Nan ; Znati, Taieb ; Al-Rodhaan, Mznah A. ; Al-Dhelaan, Abdullah. / Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks. In: Eurasip Journal on Wireless Communications and Networking. 2015 ; Vol. 2015, No. 1.
@article{e57e41557771464fa2f47d35a3dc62a6,
title = "Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks",
abstract = "A challenging problem in cognitive radio networks (CRNs) is to design a throughput efficient routing and scheduling algorithm for end-to-end communications between secondary users (SUs) in a distributed manner. Due to the opportunistic nature of CRN routing, we consider a framework with randomized path selection in this paper. Motivated by the back-pressure scheduling policy, we adopt the differential queue backlog as the routing metric to achieve throughput efficiency. Moreover, we demonstrate the sufficient condition for our framework to achieve throughput optimality by analyzing the Lyapunov drift. We further propose a distributed medium access control algorithm that can approximately satisfy the required condition when the transmission attempt probability is low. The performance of our proposed scheme is evaluated in a simulation platform, and the evaluation results verify the effectiveness of our distributed scheme.",
author = "Yuan Le and Xiuzhen Cheng and Dechang Chen and Nan Zhang and Taieb Znati and Al-Rodhaan, {Mznah A.} and Abdullah Al-Dhelaan",
year = "2015",
month = "12",
day = "1",
doi = "10.1186/s13638-015-0289-2",
language = "English (US)",
volume = "2015",
journal = "Eurasip Journal on Wireless Communications and Networking",
issn = "1687-1472",
publisher = "Springer Publishing Company",
number = "1",

}

Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks. / Le, Yuan; Cheng, Xiuzhen; Chen, Dechang; Zhang, Nan; Znati, Taieb; Al-Rodhaan, Mznah A.; Al-Dhelaan, Abdullah.

In: Eurasip Journal on Wireless Communications and Networking, Vol. 2015, No. 1, 01.12.2015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks

AU - Le, Yuan

AU - Cheng, Xiuzhen

AU - Chen, Dechang

AU - Zhang, Nan

AU - Znati, Taieb

AU - Al-Rodhaan, Mznah A.

AU - Al-Dhelaan, Abdullah

PY - 2015/12/1

Y1 - 2015/12/1

N2 - A challenging problem in cognitive radio networks (CRNs) is to design a throughput efficient routing and scheduling algorithm for end-to-end communications between secondary users (SUs) in a distributed manner. Due to the opportunistic nature of CRN routing, we consider a framework with randomized path selection in this paper. Motivated by the back-pressure scheduling policy, we adopt the differential queue backlog as the routing metric to achieve throughput efficiency. Moreover, we demonstrate the sufficient condition for our framework to achieve throughput optimality by analyzing the Lyapunov drift. We further propose a distributed medium access control algorithm that can approximately satisfy the required condition when the transmission attempt probability is low. The performance of our proposed scheme is evaluated in a simulation platform, and the evaluation results verify the effectiveness of our distributed scheme.

AB - A challenging problem in cognitive radio networks (CRNs) is to design a throughput efficient routing and scheduling algorithm for end-to-end communications between secondary users (SUs) in a distributed manner. Due to the opportunistic nature of CRN routing, we consider a framework with randomized path selection in this paper. Motivated by the back-pressure scheduling policy, we adopt the differential queue backlog as the routing metric to achieve throughput efficiency. Moreover, we demonstrate the sufficient condition for our framework to achieve throughput optimality by analyzing the Lyapunov drift. We further propose a distributed medium access control algorithm that can approximately satisfy the required condition when the transmission attempt probability is low. The performance of our proposed scheme is evaluated in a simulation platform, and the evaluation results verify the effectiveness of our distributed scheme.

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

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

U2 - 10.1186/s13638-015-0289-2

DO - 10.1186/s13638-015-0289-2

M3 - Article

AN - SCOPUS:84927732967

VL - 2015

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

SN - 1687-1472

IS - 1

ER -