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

Fingerprint

Cognitive radio
Profitability
Throughput
Communication

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

Cite this

Coalition Graph Game for Robust Routing in Cooperative Cognitive Radio Networks. / Guan, Xin; Li, Aohan; Cai, Zhipeng; Ohtsuki, Tomoaki.

In: Mobile Networks and Applications, Vol. 20, No. 2, 01.04.2015, p. 147-156.

Research output: Contribution to journalArticle

@article{b3a56302d416404eace5d2d7dd03e30d,
title = "Coalition Graph Game for Robust Routing in Cooperative Cognitive Radio Networks",
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.",
keywords = "Coalition graph theory, Cooperative cognitive radio networks, Multi-hop, Robust routing selection",
author = "Xin Guan and Aohan Li and Zhipeng Cai and Tomoaki Ohtsuki",
year = "2015",
month = "4",
day = "1",
doi = "10.1007/s11036-015-0589-0",
language = "English",
volume = "20",
pages = "147--156",
journal = "Mobile Networks and Applications",
issn = "1383-469X",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Coalition Graph Game for Robust Routing in Cooperative Cognitive Radio Networks

AU - Guan, Xin

AU - Li, Aohan

AU - Cai, Zhipeng

AU - Ohtsuki, Tomoaki

PY - 2015/4/1

Y1 - 2015/4/1

N2 - 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.

AB - 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.

KW - Coalition graph theory

KW - Cooperative cognitive radio networks

KW - Multi-hop

KW - Robust routing selection

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

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

U2 - 10.1007/s11036-015-0589-0

DO - 10.1007/s11036-015-0589-0

M3 - Article

AN - SCOPUS:84939971377

VL - 20

SP - 147

EP - 156

JO - Mobile Networks and Applications

JF - Mobile Networks and Applications

SN - 1383-469X

IS - 2

ER -