Robust topology control in multi-hop cognitive radio networks

Jing Zhao, Guohong Cao

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance may be limited since unlicensed users must vacate and switch to other available spectrum if the current spectrum is reclaimed by the licensed (primary) users. During spectrum switching, network partitions may occur since multiple links may be affected if they use the channel reclaimed by the primary users. In this paper, we address this problem through robust topology control, where channels are assigned to minimize channel interference while maintaining network connectivity when primary users appear. The problem is proved to be NP-hard and a sufficient condition for a robust channel assignment is derived. To solve this problem, we first propose centralized algorithms which can reduce the channel interference while satisfying the robustness constraints. Moreover, we derive its performance bound on channel interference and its computational overhead through theoretical analysis. Then, we propose distributed algorithms based on channel hopping techniques, and prove their correctness. Simulation results show that our solutions outperform existing interference-aware approaches substantially when primary users appear and achieve similar performance at other times.

Original languageEnglish (US)
Article number6776525
Pages (from-to)2634-2647
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume13
Issue number11
DOIs
StatePublished - Nov 1 2014

Fingerprint

Switching networks
Cognitive radio
Network performance
Parallel algorithms
Switches
Topology

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{81338f14972f484081ee2d1dacd931b9,
title = "Robust topology control in multi-hop cognitive radio networks",
abstract = "The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance may be limited since unlicensed users must vacate and switch to other available spectrum if the current spectrum is reclaimed by the licensed (primary) users. During spectrum switching, network partitions may occur since multiple links may be affected if they use the channel reclaimed by the primary users. In this paper, we address this problem through robust topology control, where channels are assigned to minimize channel interference while maintaining network connectivity when primary users appear. The problem is proved to be NP-hard and a sufficient condition for a robust channel assignment is derived. To solve this problem, we first propose centralized algorithms which can reduce the channel interference while satisfying the robustness constraints. Moreover, we derive its performance bound on channel interference and its computational overhead through theoretical analysis. Then, we propose distributed algorithms based on channel hopping techniques, and prove their correctness. Simulation results show that our solutions outperform existing interference-aware approaches substantially when primary users appear and achieve similar performance at other times.",
author = "Jing Zhao and Guohong Cao",
year = "2014",
month = "11",
day = "1",
doi = "10.1109/TMC.2014.2312715",
language = "English (US)",
volume = "13",
pages = "2634--2647",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

Robust topology control in multi-hop cognitive radio networks. / Zhao, Jing; Cao, Guohong.

In: IEEE Transactions on Mobile Computing, Vol. 13, No. 11, 6776525, 01.11.2014, p. 2634-2647.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Robust topology control in multi-hop cognitive radio networks

AU - Zhao, Jing

AU - Cao, Guohong

PY - 2014/11/1

Y1 - 2014/11/1

N2 - The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance may be limited since unlicensed users must vacate and switch to other available spectrum if the current spectrum is reclaimed by the licensed (primary) users. During spectrum switching, network partitions may occur since multiple links may be affected if they use the channel reclaimed by the primary users. In this paper, we address this problem through robust topology control, where channels are assigned to minimize channel interference while maintaining network connectivity when primary users appear. The problem is proved to be NP-hard and a sufficient condition for a robust channel assignment is derived. To solve this problem, we first propose centralized algorithms which can reduce the channel interference while satisfying the robustness constraints. Moreover, we derive its performance bound on channel interference and its computational overhead through theoretical analysis. Then, we propose distributed algorithms based on channel hopping techniques, and prove their correctness. Simulation results show that our solutions outperform existing interference-aware approaches substantially when primary users appear and achieve similar performance at other times.

AB - The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance may be limited since unlicensed users must vacate and switch to other available spectrum if the current spectrum is reclaimed by the licensed (primary) users. During spectrum switching, network partitions may occur since multiple links may be affected if they use the channel reclaimed by the primary users. In this paper, we address this problem through robust topology control, where channels are assigned to minimize channel interference while maintaining network connectivity when primary users appear. The problem is proved to be NP-hard and a sufficient condition for a robust channel assignment is derived. To solve this problem, we first propose centralized algorithms which can reduce the channel interference while satisfying the robustness constraints. Moreover, we derive its performance bound on channel interference and its computational overhead through theoretical analysis. Then, we propose distributed algorithms based on channel hopping techniques, and prove their correctness. Simulation results show that our solutions outperform existing interference-aware approaches substantially when primary users appear and achieve similar performance at other times.

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

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

U2 - 10.1109/TMC.2014.2312715

DO - 10.1109/TMC.2014.2312715

M3 - Article

AN - SCOPUS:84907808041

VL - 13

SP - 2634

EP - 2647

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 11

M1 - 6776525

ER -