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
N1 - Funding Information:
This work was supported in part by the National Science Foundation (NSF) under Grants No. CNS-1252292. Heilongjiang Province Education Department Foundation (12531Z007), China, and Natural Science Foundation of Heilongjiang Province, China (F201019).
Publisher Copyright:
© 2015, Springer Science+Business Media New York.
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
SN - 1383-469X
VL - 20
SP - 147
EP - 156
JO - Mobile Networks and Applications
JF - Mobile Networks and Applications
IS - 2
ER -