Coalition Graph Game for Robust Routing in Cooperative Cognitive Radio Networks

Xin Guan, Aohan Li, Zhipeng Cai, Tomoaki Ohtsuki

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

This paper mainly studies on the problem of robust multi-hop routing selection in Cooperative Cognitive Radio Networks (CCRNs). Our objective is to improve the throughput of Primary Users (PUs) while increase the opportunity that Secondary Users (SUs) can access the licensed spectrum. We combine the multi-hop routing selection problem with the graph-based cooperative game and bipartite graph model. A novel effective multi-hop routing selection algorithm called GBRA is proposed for CCRNs. The effect of relays to the routing path on throughput is considered. A novel method is introduced to divide coalition. A fair allocation rule to allocate the total profits of one coalition to its members is also introduced. Finally, based on the proposed coalition division method and the proposed profits allocation scheme in one coalition, the stability of the multi-hop routing path selected by GBRA is proved. Theoretical analysis and performance evaluation show that both PUs and SUs can improve their communication performance when they cooperate with each other.

Original languageEnglish
Pages (from-to)147-156
Number of pages10
JournalMobile Networks and Applications
Volume20
Issue number2
DOIs
Publication statusPublished - 2015 Apr 1

Keywords

  • Coalition graph theory
  • Cooperative cognitive radio networks
  • Multi-hop
  • Robust routing selection

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Software

Fingerprint Dive into the research topics of 'Coalition Graph Game for Robust Routing in Cooperative Cognitive Radio Networks'. Together they form a unique fingerprint.

Cite this