TIGHT: A geographic routing protocol for cognitive radio mobile Ad Hoc networks

Xiaocong Jin, Rui Zhang, Jingchao Sun, Yanchao Zhang

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

This paper presents TIGHT, a geographic routing protocol for cognitive radio mobile ad hoc networks. TIGHT offers three routing modes and allows secondary users to fully explore the transmission opportunities over a primary channel without affecting primary users (PUs). The greedy mode routes a packet via greedy geographic forwarding until a PU region is encountered and then further routes the packet around the PU region to where greedy forwarding can resume. It works best when the PUs are only occasionally active. In contrast, the optimal and suboptimal modes route a packet along optimal and suboptimal trajectories to the destination, respectively. They work best when the PUs are active most of the time. The suboptimal mode is computationally more efficient than the optimal mode at the cost of using suboptimal trajectories in rare cases. The efficacy of TIGHT is confirmed by extensive simulations.

Original languageEnglish (US)
Article number6807739
Pages (from-to)4670-4681
Number of pages12
JournalIEEE Transactions on Wireless Communications
Volume13
Issue number8
DOIs
StatePublished - 2014

Fingerprint

Cognitive Radio
Cognitive radio
Mobile ad hoc networks
Mobile Ad Hoc Networks
Routing Protocol
Routing protocols
Trajectories
Trajectory
Efficacy
Routing
Simulation

Keywords

  • Cognitive radio
  • CR-MANET
  • Geographic routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

TIGHT : A geographic routing protocol for cognitive radio mobile Ad Hoc networks. / Jin, Xiaocong; Zhang, Rui; Sun, Jingchao; Zhang, Yanchao.

In: IEEE Transactions on Wireless Communications, Vol. 13, No. 8, 6807739, 2014, p. 4670-4681.

Research output: Contribution to journalArticle

@article{950f9d3549bf4344934b182c2ae2d3e5,
title = "TIGHT: A geographic routing protocol for cognitive radio mobile Ad Hoc networks",
abstract = "This paper presents TIGHT, a geographic routing protocol for cognitive radio mobile ad hoc networks. TIGHT offers three routing modes and allows secondary users to fully explore the transmission opportunities over a primary channel without affecting primary users (PUs). The greedy mode routes a packet via greedy geographic forwarding until a PU region is encountered and then further routes the packet around the PU region to where greedy forwarding can resume. It works best when the PUs are only occasionally active. In contrast, the optimal and suboptimal modes route a packet along optimal and suboptimal trajectories to the destination, respectively. They work best when the PUs are active most of the time. The suboptimal mode is computationally more efficient than the optimal mode at the cost of using suboptimal trajectories in rare cases. The efficacy of TIGHT is confirmed by extensive simulations.",
keywords = "Cognitive radio, CR-MANET, Geographic routing",
author = "Xiaocong Jin and Rui Zhang and Jingchao Sun and Yanchao Zhang",
year = "2014",
doi = "10.1109/TWC.2014.2320950",
language = "English (US)",
volume = "13",
pages = "4670--4681",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - TIGHT

T2 - A geographic routing protocol for cognitive radio mobile Ad Hoc networks

AU - Jin, Xiaocong

AU - Zhang, Rui

AU - Sun, Jingchao

AU - Zhang, Yanchao

PY - 2014

Y1 - 2014

N2 - This paper presents TIGHT, a geographic routing protocol for cognitive radio mobile ad hoc networks. TIGHT offers three routing modes and allows secondary users to fully explore the transmission opportunities over a primary channel without affecting primary users (PUs). The greedy mode routes a packet via greedy geographic forwarding until a PU region is encountered and then further routes the packet around the PU region to where greedy forwarding can resume. It works best when the PUs are only occasionally active. In contrast, the optimal and suboptimal modes route a packet along optimal and suboptimal trajectories to the destination, respectively. They work best when the PUs are active most of the time. The suboptimal mode is computationally more efficient than the optimal mode at the cost of using suboptimal trajectories in rare cases. The efficacy of TIGHT is confirmed by extensive simulations.

AB - This paper presents TIGHT, a geographic routing protocol for cognitive radio mobile ad hoc networks. TIGHT offers three routing modes and allows secondary users to fully explore the transmission opportunities over a primary channel without affecting primary users (PUs). The greedy mode routes a packet via greedy geographic forwarding until a PU region is encountered and then further routes the packet around the PU region to where greedy forwarding can resume. It works best when the PUs are only occasionally active. In contrast, the optimal and suboptimal modes route a packet along optimal and suboptimal trajectories to the destination, respectively. They work best when the PUs are active most of the time. The suboptimal mode is computationally more efficient than the optimal mode at the cost of using suboptimal trajectories in rare cases. The efficacy of TIGHT is confirmed by extensive simulations.

KW - Cognitive radio

KW - CR-MANET

KW - Geographic routing

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

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

U2 - 10.1109/TWC.2014.2320950

DO - 10.1109/TWC.2014.2320950

M3 - Article

AN - SCOPUS:84906265804

VL - 13

SP - 4670

EP - 4681

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 8

M1 - 6807739

ER -