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

Xiaocong Jin, Rui Zhang, Jingchao Sun, Yanchao Zhang

Research output: Contribution to journalArticlepeer-review

42 Scopus citations


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
Issue number8
StatePublished - Aug 2014


  • Cognitive radio
  • Geographic routing

ASJC Scopus subject areas

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


Dive into the research topics of 'TIGHT: A geographic routing protocol for cognitive radio mobile Ad Hoc networks'. Together they form a unique fingerprint.

Cite this