Skip to main content
SpringerLink
Log in

Dynamic Opportunistic Spectrum Access with Channel Bonding in Mesh Networks: A Game-Theoretic Approach

  • Conference paper
  • First Online:
Machine Learning and Intelligent Communications (MLICOM 2018)

Abstract

The opportunistic spectrum access with dynamic users and channel bonding technology in mesh networks is studied in this paper. Different from the traditional static and fixed transmitting model, nodes would change their states between active and silent, due to their traffic demand. Also, the channel bonding technology, which mitigates interference and improves throughput significantly, is employed in this paper. The interference mitigation problem with channel bonding is modeled as a distributed and non-cooperative game. We proved it to be an exact potential game. Based on the good property of the potential game, it guarantees the existence of at least one pure Nash equilibrium (NE). Due to the potential function is formulated as the aggregate interference of the network, the final optimal NE point also achieves the minimization of the system’s total interference. A multiple-agent learning algorithm is designed to approach the NE points. Compared with other algorithms, simulation results show that the modified algorithm achieves a lower interference performance, and the channel bonding contributes to the throughput performance.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For the without channel bonding situations, to make the total power same with the channel bonding situations, the power on each channel is set as 0.2 W.

References

  1. Bukhari, S.H.R., Rehmani, M.H., Siraj, S.: A survey of channel bonding for wireless networks and guidelines of channel bonding for futuristic cognitive radio sensor networks. IEEE Commun. Surv. Tutor. 18(2), 924–948 (2016)

    Article  Google Scholar 

  2. Khan, Z., Lehtomaki, J., Scott, S., Han, Z., Krunz, M., Marshall, A.: Distributed and coordinated spectrum access methods for heterogeneous channel bonding. IEEE Trans. Cogn. Commun. Netw. 3(3), 267–281 (2017)

    Article  Google Scholar 

  3. Joshi, S., Pawelczak, P., Cabric, D., Villasenor, J.: When channel bonding is beneficial for opportunistic spectrum access networks. IEEE Trans. Wirel. Commun. 11(11), 3942–3956 (2012)

    Article  Google Scholar 

  4. Xu, Y., Anpalagan, A., Wu, Q., Shen, L., Gao, Z., Wang, J.: Decision-theoretic distributed channel selection for opportunistic spectrum access: strategies, challenges and solutions. IEEE Commun. Surv. Tutor. 15(4), 1689–1713 (2013). Fourth Quarter

    Article  Google Scholar 

  5. Xu, Y., Wang, J., Wu, Q., et al.: Opportunistic spectrum access in cognitive radio networks: global optimization using local interaction games. IEEE J. Sel. Top. Singal Process. 6(2), 180–194 (2012)

    Article  Google Scholar 

  6. Zhang, Y., Xu, Y., Wu, Q.: Opportunistic spectrum access with dynamic users: directional graphical game and stochastic learning. KSII Trans. Internet Inf. Syst. 11(12–8), 5820–5824 (2017)

    Google Scholar 

  7. Zhang, Y., Zhao, Q.: Distributed opportunistic spectrum access with dynamic users: a game-theoretic learning approach. In: 2015 International Conference on Wireless Communications & Signal Processing (WCSP), Nanjing, pp. 1–5, October 2015

    Google Scholar 

  8. Yao, K., Wu, Q., Xu, Y., Jing, J.: Distributed ABS-slot access in dense heterogeneous networks: a potential game approach with generalized interference model. IEEE Access 5, 94–104 (2017)

    Article  Google Scholar 

  9. Zhu, X., Liu, X., Xu, Y., Zhang, Y., Ruan, L., Yang, Y.: Dynamic spectrum access for D2D networks: a hypergraph game approach. In: IEEE ICCT 2017, Chengdu, China (2017)

    Google Scholar 

  10. Xu, Y.: Load-aware dynamic spectrum access for small-cell networks: a graphical game approach. IEEE Trans. Veh. Technol. 65(10), 8794–8800 (2016)

    Article  Google Scholar 

  11. Monderer, D., Shapley, L.S.: Potential games. Game Econ. Behav. 14, 124–143 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mukherjee, A., Fakoorian, S.A.A., Huang, J., Swindlehurst, A.L.: A comprehensive survey of potential game approaches to wireless networks. IEEE Commun. Surv. Tutor. 16(3), 1550–1573 (2014)

    Article  Google Scholar 

  13. Zhang, Y., Xu, Y., Wu, Q., Yao, K., Anpalagan, A.: A game-theoretic approach for optimal distributed cooperative hybrid caching in D2D networks. IEEE Wirel. Commun. Lett. (2018, to appear)

    Google Scholar 

Download references

Acknowledgment

This work was supported in part by the Natural Science Foundation for Distinguished Young Scholars of Jiangsu Province under Grant BK20160034, in part by the National Science Foundation of China under Grant 61631020, Grant 61401508, and Grant 61671473, and in part by the Open Research Foundation of Science and Technology on Communication Networks Laboratory.

Author information

Authors and Affiliations

  1. College of Communication Engineering, Army Engineering University of PLA, Haifuxiang 1st, Nanjing, 210007, China

    Chen Pan, Yunpeng Cheng & Yuli Zhang

  2. No. 92274 Troops of PLA, Kunming, 650000, China

    Zhengju Yang

Authors
  1. Chen Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunpeng Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhengju Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yuli Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yunpeng Cheng .

Editor information

Editors and Affiliations

  1. Zhejiang University of Technology, Hangzhou Shi, China

    Limin Meng

  2. Department of Networks, Simula Research Laboratory, Oslo, Norway

    Yan Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pan, C., Cheng, Y., Yang, Z., Zhang, Y. (2018). Dynamic Opportunistic Spectrum Access with Channel Bonding in Mesh Networks: A Game-Theoretic Approach. In: Meng, L., Zhang, Y. (eds) Machine Learning and Intelligent Communications. MLICOM 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 251. Springer, Cham. https://doi.org/10.1007/978-3-030-00557-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00557-3_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00556-6

  • Online ISBN: 978-3-030-00557-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation