Skip to main content
SpringerLink
Log in

Coalition Graph Game for Robust Routing in Cooperative Cognitive Radio Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Peha JM (2005) Approaches to spectrum sharing. IEEE Commun Mag 43(2):10–12

    Article  Google Scholar 

  2. Wang B, Liu KJR (2011) Advances in cognitive radio networks: a survey. IEEE J Sel Topics Signal Process 5(1):5–23

    Article  Google Scholar 

  3. Wei T, Sun G, Wang X, Guizani M (2013) Opportunistic access for cooperative cognitive radio networks with requirement constraint. In: Communications (ICC), Budapest , pp 6317–6321

  4. Cao B, Mark JW, Zhang Q, Lu R, Lin X, Shen X (2013) On optimal communication strategies for copperative cognitive radio networking. In: Proceedings of INFOCOM, pp 1726–1734, Turin

  5. Jing T, Zhu S, Li H, Cheng X, Huo Y (2013) Cooperative relay selection in cognitive radio networks. In: Proceedings of INFOCOM, pp 175–179 Turin

  6. Zhang N, Lu N, Lu R, Mark JW, Shen X (2012) Energy-efficient and trust-aware cooperation in cognitive radio networks. In: Communications (ICC), pp 1763–1767, Ottawa, ON

  7. Toroujeni SMM, Sadough SM, Ghorashi SA (2013) Spectrum leasing for ofdm-based cognitive radio networks. IEEE Trans Veh Techno 62(5):2131–2139

    Article  Google Scholar 

  8. Qu Z, Gu S, Yang G, Wang X, Tian X, Gan X (2011) A distributed relay selection algorithm using game on real-time Testbed. In: Proceedings of GLOBECOM, pp 1–5, Houston

  9. Boukerche A, Cheng X, Linus J (2003) Energy-aware data-centric routing in microsensor networks. In: Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems, pp 42–49, New York

  10. Cao B, Mark JW, Zhang Q (2012) A polarization enabled cooperation framework for cognitive radio networking. In: Proceedings of GLOBECOM, pp 1114–1119, Anaheim

  11. Cao B, Cai LX, Liang H, Mark JW, Zhang Q, Poor HV, Zhuang W (2012) Cooperative cognitive radio networking using quadrature signaling. In: Proceedings of INFOCOM, pp 3096–3100, Orlando

  12. Zhang G, Yang K, Hu Y, Li X, Hu L (2012) Fair and efficient spectrum splitting for cooperative cognitive radio networks. In: Proceedings of the GLOBECOM, pp 4916–4920, Anaheim

  13. Jiang J, Han G, Wang F, Shu L, Guizani M (2014) An efficient distributed trust model for wireless sensor networks. In: IEEE transactions on parallel and distributed systems

  14. Han G, Dong Y, Guo H, Shu L, Wu D (2014) Cross-layer optimized routing in WSN with duty-cycle and energy harvesting. Wireless Communications and Mobile Computing

  15. Han G, Guo H, Zhang C, Shu L (2014) Parameter optimisation in duty-cycled wireless sensor networks under expected network lifetime. International Journal of Ad Hoc and Ubiquitous Computing 15(1–3):57–67

    Article  Google Scholar 

  16. Cheng X, Huang X, Li D, Wu W, Du D (2003) A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4):202–208

    Article  MATH  MathSciNet  Google Scholar 

  17. Cheng X, Du D, Wang L, Xu B (2008) Relay sensor placement in wireless sensor networks. Wireless Networks 14(3): 347–355

    Article  Google Scholar 

  18. Cheng S, Li J, Cai Z (2013) O(𝜖)-approximation to physical world by sensor networks. In: Proceedings of INFOCOM, pp 3084–3092, Turin

  19. Li J, Cheng S, Gao H, Cai Z (2014) Approximate physical world reconstruction algorithms in sensor networks. IEEE Transactions on Parallel and Distributed Systems PP(99):1

    Google Scholar 

  20. Zhai L, Ji H, Li X, Tang Y (2012) Coalition graph game for joint relay selection and resource allocation in cooperative cognitive radio networks. In: Proceedings of GLOBECOM, pp 1818–1823, Anaheim, CA

  21. Zhang Y, Yu R, Nekovee M, Liu Y, Xie S, Gjessing S (2012) Cognitive machine-to-machine communications: visions and potentials for the smart grid. IEEE Network Magazine 26(3):6–13

    Article  Google Scholar 

  22. Yu R, Zhang Y, Liu Y, Xie S, Song L, Guizani M (2012) Secondary users cooperation in cognitive radio networks: balancing sensing accuracy and efficiency. IEEE Wireless Communications Magazine 19(2):30–37

    Article  Google Scholar 

  23. Xie S, Liu Y, Zhang Y, Yu R (2010) A parallel cooperative spectrum sensing in cognitive radio networks. IEEE Transactions on Vehicular Technology 59(8):4079–4092

    Article  Google Scholar 

  24. Li W, Cheng X, Jing T, Xing X (2013) Cooperative multi-hop relaying via network formation games in cognitive radio networks. In: Proceeding of the INFOCOM, pp 971–979, Turin

  25. Myerson R B (1977) Graphs and cooperation in games. Math Oper Res 2(3):225–229

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Heilongjiang University, Harbin, Heilongjiang, 150080, China

    Xin Guan

  2. School of Electronic Engineering, Heilongjiang University, Harbin, Heilongjiang, 150080, China

    Aohan Li

  3. Department of Computer Science, Georgia State University, 34 Peachtree Street, suite 1410, Atlanta, GA, 30303, USA

    Zhipeng Cai

  4. Graduate School of Science and Technology, Keio University, Yokohama-shi, 223-8522, Japan

    Tomoaki Ohtsuki

Authors
  1. Xin Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aohan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhipeng Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tomoaki Ohtsuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xin Guan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guan, X., Li, A., Cai, Z. et al. Coalition Graph Game for Robust Routing in Cooperative Cognitive Radio Networks. Mobile Netw Appl 20, 147–156 (2015). https://doi.org/10.1007/s11036-015-0589-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-015-0589-0

Keywords

Search

Navigation