Skip to main content

Advertisement

SpringerLink
Log in

Game-Theoretic User Association in Ultra-dense Networks with Device-to-Device Relays

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Device-to-device communication can assist cellular networks by making certain users equipment (UEs) work as relays between the base station (BS) and other users. In this paper, we present the ultra-dense network (UDN) with D2D relays instead of small cells, where UEs can form into clusters according to the traffic demand in hot-spot areas. Each UE requires to decide whether to connect to the BS, or to get associated with one of the D2D relays, a.k.a. cluster heads (CHs). To optimize the downlink system performance, we propose a game-theoretic user association scheme in the UDN with D2D relays, specifically focused on load balancing among the BS and CHs. The dynamic user association is formulated as a hedonic coalition game where we adopt a simplified but efficient measurement of the utility and select the effective game players in a smaller number. In the game, we estimate the number of users associated with each CH at the Nash-stable state which can indicate the overall expected load condition, and an admission control mechanism is finally employed on the basis of these values. Simulation results show that the UDN adopting the D2D relay technology can achieve a higher system rate than the traditional cellular network, and the proposed user association scheme outperforms the existing schemes while having a small computational complexity.

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
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. The user association scheme in [14] and that in [15] are similar to each other with slight changes, therefore we treat them as one throughout the rest of this paper.

  2. Even if the UE gets associated with a CH, it still needs the \(f_1\) resource for its backhaul link, and we assume that CHs have no demands for transmitting their own data, so here the denominator is N.

  3. The time complexity of the exhaustive search scheme is still considerable. Taking the case of \(N=10\) and \(C=3\) as an example, the complexity reaches as high as \((3+1)^{10}\).

  4. The comparison of complexity between the proposed scheme and scheme in [14, 15] depends on the exact values of N and C. For example, when \(N=500\) and \(C=20\), the complexity of the proposed scheme is higher; but when \(N=500\) and \(C=100\), that of the scheme in [14, 15] becomes higher.

References

  1. Osseiran, A., Boccardi, F., Braun, V., Kusume, K., Marsch, P., Maternia, M., et al. (2014). Scenarios for 5G mobile and wireless communications: The vision of the metis project. IEEE Communications Magazine, 52(5), 26–35.

    Article  Google Scholar 

  2. Baldemair, R., Irnich, T., Balachandran, K., Dahlman, E., Mildh, G., Selén, Y., et al. (2015). Ultra-dense networks in millimeter-wave frequencies. IEEE Communications Magazine, 53(1), 202–208.

    Article  Google Scholar 

  3. Valkama, M., & Niemelä, J. (2015). Spectral and energy efficiency of ultra-dense networks under different deployment strategies. IEEE Communications Magazine, 53(1), 90–100.

    Article  Google Scholar 

  4. Li, Y.-N. R., Li, J., Wu, H., & Z., Wenfeng. (2014). Energy efficient small cell operation under ultra dense cloud radio access networks. In Globecom Workshops (GC Wkshps), 2014 (pp. 1120–1125). IEEE.

  5. Doppler, K., Rinne, M., Wijting, C., Ribeiro, C. B., & Hugl, K. (2009). Device-to-device communication as an underlay to LTE-advanced networks. IEEE Communications Magazine, 47(12), 42–49.

    Article  Google Scholar 

  6. Zhang, G., Yang, K., Shuanshuan, W., Mei, X., & Zhao, Z. (2015). Efficient power control for half-duplex relay based D2D networks under sum power constraints. Wireless Networks, 21(7), 2345–2355.

    Article  Google Scholar 

  7. Gong, W., & Wang, X. (2015). Particle swarm optimization based power allocation schemes of device-to-device multicast communication. Wireless Personal Communications, 85(3), 1261–1277.

    Article  Google Scholar 

  8. Lin, X., Ratasuk, R., Ghosh, A., & Andrews, J. G. (2014). Modeling, analysis, and optimization of multicast device-to-device transmissions. IEEE Transactions on Wireless Communications, 13(8), 4346–4359.

    Article  Google Scholar 

  9. Zhou, B., Honglin, H., Huang, S.-Q., & Chen, H.-H. (2013). Intracluster device-to-device relay algorithm with optimal resource utilization. IEEE Transactions on Vehicular Technology, 62(5), 2315–2326.

    Article  Google Scholar 

  10. TR 36.843. (2014). Study on LTE device to device proximity services; radio aspects (release 12). Technical report, 3GPP Technical report.

  11. RP-151952. (2015). Enhanced D2D status report for ran 70. Technical report, Status Report to TSG.

  12. Damnjanovic, A., Montojo, J., Wei, Y., Ji, T., Luo, T., Vajapeyam, M., et al. (2011). A survey on 3GPP heterogeneous networks. IEEE Wireless Communications, 18(3), 10–21.

    Article  Google Scholar 

  13. Mezzavilla, M., Somasundaram, K., & Zorzi, M. (2014). Joint user association and resource allocation in UE-relay assisted heterogeneous networks. In 2014 IEEE International Conference on Communications Workshops (ICC), pp. 628–634.

  14. Yu, Y., Hu, R. Q., Bontu, C. S., & Cai, Z. (2011). Mobile association and load balancing in a cooperative relay cellular network. IEEE Communications Magazine, 49(5), 83–89.

    Article  Google Scholar 

  15. Siviloglou, O., Rouskas, A., & Karetsos, G. (2015). Association of mobile stations in cellular networks with relay nodes. In 2015 38th international conference on telecommunications and signal processing (TSP), pp. 1–5.

  16. Singh, S., Dhillon, H. S., & Andrews, J. G. (2013). Offloading in heterogeneous networks: Modeling, analysis, and design insights. IEEE Transactions on Wireless Communications, 12(5), 2484–2497.

    Article  Google Scholar 

  17. Sadr, S., & Adve, R. S. (2014). Tier association probability and spectrum partitioning for maximum rate coverage in multi-tier heterogeneous networks. IEEE Communications Letters, 18(10), 1791–1794.

    Article  Google Scholar 

  18. Lin, Y., & Yu, W. (2013). Optimizing user association and frequency reuse for heterogeneous network under stochastic model. In 2013 IEEE global communications conference (GLOBECOM) (pp. 2045–2050). IEEE.

  19. West, D. B., et al. (2001). Introduction to graph theory (Vol. 2). Upper Saddle River: Prentice Hall.

    Google Scholar 

  20. Li, Q., Hu, R. Q., Wu, G., & Qian, Y. (2012). On the optimal mobile association in heterogeneous wireless relay networks. In INFOCOM, 2012 Proceedings IEEE, pp. 1359–1367.

  21. Li, G., Zhao, Y., & Bian, K. (2016). Efficient user association in cellular networks with hybrid cognitive radio relays. IEEE Communications Letters, 20(7), 1413–1416.

    Google Scholar 

  22. Ray, D. (2007). A game-theoretic perspective on coalition formation. Oxford: Oxford University Press.

    Book  MATH  Google Scholar 

  23. Saad, W., Han, Z., Basar, T., Debbah, M., & Hjorungnes, A. (2011). Hedonic coalition formation for distributed task allocation among wireless agents. IEEE Transactions on Mobile Computing, 10(9), 1327–1344.

    Article  Google Scholar 

  24. Jackson, O. (2006). Definitions of equilibrium in network formation games. International Journal of Game Theory, 34(3), 305–318.

    Article  MathSciNet  MATH  Google Scholar 

  25. Sui, Y., Guvenc, I., & Svensson, T. (2015). Interference management for moving networks in ultra-dense urban scenarios. EURASIP Journal on Wireless Communications and Networking, 2015(1), 1–32.

    Article  Google Scholar 

  26. Raj, J., Dah-Ming, C., & Hawe, W. R. (1984). A quantitative measure of fairness and discrimination for resource allocation in shared computer system (Vol. 38). Hudson, MA: Eastern Research Laboratory, Digital Equipment Corporation.

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by Huawei Technologies Company, Ltd., and in part by the National Science and Technology Major Project of China under Grant 2016ZX03001018-005.

Author information

Authors and Affiliations

  1. Department of Computer Science, Tongji University, Shanghai, China

    Geng Li

  2. Department of Computer Science, Yale University, New Haven, CT, USA

    Geng Li

  3. School of Electronics Engineering and Computer Science, Peking University, Beijing, China

    Yuping Zhao & Dou Li

Authors
  1. Geng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuping Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dou Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Geng Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, G., Zhao, Y. & Li, D. Game-Theoretic User Association in Ultra-dense Networks with Device-to-Device Relays. Wireless Pers Commun 95, 2691–2708 (2017). https://doi.org/10.1007/s11277-017-3950-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-3950-8

Keywords

Search

Navigation