Research Article
Coalition Graph Game for Multi-hop Routing Path Selection in Cooperative Cognitive Radio Networks
@INPROCEEDINGS{10.4108/icst.chinacom.2014.256445, author={Aohan Li and Xin Guan and Ziheng Yang and Tomoaki OHTSUKI}, title={Coalition Graph Game for Multi-hop Routing Path Selection in Cooperative Cognitive Radio Networks}, proceedings={9th International Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2015}, month={1}, keywords={cooperative cognitive radio network; multi-hop; graph theory; routing path selection algorithm; coalition; totally stable}, doi={10.4108/icst.chinacom.2014.256445} }- Aohan Li
Xin Guan
Ziheng Yang
Tomoaki OHTSUKI
Year: 2015
Coalition Graph Game for Multi-hop Routing Path Selection in Cooperative Cognitive Radio Networks
CHINACOM
IEEE
DOI: 10.4108/icst.chinacom.2014.256445
Abstract
This paper mainly study on the problem of multihop routing path selection in Cooperative Cognitive Radio Network (CCRN). Our objective is to improve the effective throughput of primary users (PUs) while increase the opportunity that secondary users (SUs) can access the licensed spectrum owned by PUs. We combine the multi-hop routing selection problem with the graph-based cooperative game. We propose a new effective multi-hop cooperative routing path selection algorithm called GBRA for CCRN. We introduce a new method to divide coalition. We also propose a fair allocation rule to allocate the total profits of one coalition to the members in this coalition. Finally, we prove the stability of multi-hop cooperative routing paths which selected by GBRA. Simulation results show the performance of GBRA.
