A game theoretic learning solution for distributed relay selection on throughput optimization | Wireless Networks Skip to main content
Springer Nature Link
Log in

A game theoretic learning solution for distributed relay selection on throughput optimization

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In this paper, we study the problem of distributed relay selection in wireless networks using a game theoretic approach. Specifically, we consider a system model where one relay node can be shared by multiple source-destination pairs. Our objective is to find the relay selections of source nodes to optimize the total capacity. The relay selection problem is formulated as a congestion game with player-specific payoff functions and the existence of Nash equilibrium (NE) is demonstrated. Then we propose a stochastic learning automata (SLA) based distributed relay selection approach to obtain the NE without information exchange among source nodes. Simulation results show that the proposed distributed relay selection approach achieves satisfactory performance, when compared with other solutions.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

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

Similar content being viewed by others

References

  1. Zhao, Y., Adve, R., & Lim, T. J. (2007). Improving amplify-and-forward relay networks: Optimal power allocation versus selection. IEEE Transactions on Wireless Communications, 6(8), 3114–3123.

    Google Scholar 

  2. Yang, D., Fang, X., & Xue, G. (2011). “OPRA: Optimal relay assignment for capacity maximization in cooperative networks,” 2011 IEEE International Conference on Communications (ICC), pp. 1–6.

  3. Li, G., & Liu, H. (2004). “Resource allocation for ofdma relay networks,” Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004, vol. 1, pp. 1203–1207.

  4. Sharma, S., Shi, Y., Hou, Y., & Kompella, S. (2011). An optimal algorithm for relay node assignment in cooperative ad hoc networks. IEEE/ACM Transactions on Networking, 19(3), 879–892.

    Article  Google Scholar 

  5. Shi, Y., Sharma, S., Hou, Y. T., & Kompella, S. (2008). Optimal relay assignment for cooperative communications, in Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, pp. 3–12, ACM.

  6. Wu, C., Lin, T., Liu, H., & Chen, Z. (2014). On relay assignment strategy in wireless cellular environment, 2014 International Conference on Computing, Networking and Communications (ICNC), pp. 698–703.

  7. Chen, Z., Lin, T., & Wu, C. (2016). Decentralized learning-based relay assignment for cooperative communications. IEEE Transactions on Vehicular Technology, 65(2), 813–826.

    Article  Google Scholar 

  8. Cai, J., Shen, X., Mark, J. W., & Alfa, A. (2008). Semi-distributed user relaying algorithm for amplify-and-forward wireless relay networks. IEEE Transactions on Wireless Communications, 7(4), 1348–1357.

    Article  Google Scholar 

  9. Abdulhadi, S., Jaseemuddin, M., & Anpalagan, A. (2012). A survey of distributed relay selection schemes in cooperative wireless Ad hoc networks. Wireless Personal Communications, 63(4), 917–935.

    Article  Google Scholar 

  10. Meulen, E. C. V. D. (1971). Three terminal communication channels. Advanced in Applied Probability, 3, 120–154.

    Article  MathSciNet  MATH  Google Scholar 

  11. Cover, T., & Gamal, A. (1979). Capacity theorems for the relay channel. IEEE Transactions on Information Theory, 25(5), 572–584.

    Article  MathSciNet  MATH  Google Scholar 

  12. Saghezchi, F. B., Nascimento, A., Albano, M., Radwan, A., & Rodriguez, J. (2011). A novel relay selection game in cooperative wireless networks based on combinatorial optimization, 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring), pp. 1–6.

  13. Saghezchi, F. B., Radwan, A., Rodriguez, J., & Taha, A. E. M. (2014). Coalitional relay selection game to extend battery lifetime of multi-standard mobile terminals, 2014 IEEE International Conference on Communications (ICC), pp. 508–513.

  14. Chen, G., Zhong, W., & Tian, H. (2013). Relay selection in cognitive relay networks via potential game, 2013 IEEE Wireless Communications and Networking Conference (WCNC), pp. 3676–3681.

  15. Wei, Z., Gang, C., Shi, J., & Kai-Kit, W. (2014). Relay selection and discrete power control for cognitive relay networks via potential game. IEEE Transactions on Signal Processing, 62, 5411–5424.

    Article  MathSciNet  Google Scholar 

  16. Bletsas, A., Khisti, A., Reed, D., & Lippman, A. (2006). A simple cooperative diversity method based on network path selection. IEEE Journal on Selected Areas in Communications, 24(3), 659–672.

    Article  Google Scholar 

  17. Wang, B., Han, Z., & Liu, K. J. R. (2009). Distributed relay selection and power control for multiuser cooperative communication networks using stackelberg game. IEEE Transactions on Mobile Computing, 8(7), 975–990.

    Article  Google Scholar 

  18. Wang, B., Han, Z., & Liu, K. J. R. (2007). Distributed relay selection and power control for multiuser cooperative communication networks using buyer/seller game, IEEE INFOCOM 2007. 26th IEEE International Conference on Computer Communications, pp. 544–552.

  19. Nazir, M., & Rajatheva, N. (2010). Relay selection techniques in cooperative communication using game theory, 2010 Second International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN), pp. 130–136.

  20. Sergi, S., & Vietta, G. M. (2010). A game theoretical approach to distributed relay selection in randomized cooperation. IEEE Transactions on Wireless Communications, 9(8), 2611–2621.

    Article  Google Scholar 

  21. Saha, A., Ghosh, A., & Hamouda, W. (2014). Learning-based relay selection for cooperative networks, 2014 IEEE Global Communications Conference (GLOBECOM), pp. 386–391.

  22. Laneman, J., Tse, D., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.

    Article  MathSciNet  MATH  Google Scholar 

  23. Zhang, H., Jiang, C., Beaulieu, N. C., Chu, X., Wang, X., & Quek, T. Q. S. (2015). Resource allocation for cognitive small cell networks: A cooperative bargaining game theoretic approach. IEEE Transactions on Wireless Communications, 14(6), 3481–3493.

    Article  Google Scholar 

  24. Milchtaich, I. (1996). Congestion games with player-specific payoff functions. Games and Economic Behavior, 13(1), 111–124.

    Article  MathSciNet  MATH  Google Scholar 

  25. Monderer, D., & Shapley, L. (1996). Potential Games. Games and Economic Behavior, 14, 124–143.

    Article  MathSciNet  MATH  Google Scholar 

  26. Xing, Y., Mathur, C. N., Haleem, M. A., Chandramouli, R., & Subbalakshmi, K. P. (2007). Dynamic spectrum access with QoS and interference temperature constraints. IEEE Transactions on Mobile Computing, 6(4), 423–433.

    Article  Google Scholar 

  27. Xu, Y., Wu, Q., Shen, L., Wang, J., & Anpalagan, A. (2015). Robust multiuser sequential channel sensing and access in dynamic cognitive radio networks: Potential games and stochastic learning. IEEE Transactions on Vehicular Technology, 64(8), 3594–3607.

    Article  Google Scholar 

  28. Xu, Y., Wang, J., Wu, Q., Anpalagan, A., & Yao, Y. D. (2012). Opportunistic spectrum access in unknown dynamic environment: A game-theoretic stochastic learning solution. IEEE Transactions on Wireless Communications, 11, 1380–1391.

    Article  Google Scholar 

  29. Sastry, P., Phansalkar, V., & Thathachar, M. (1994). Decentralized learning of nash equilibria in multi-person stochastic games with incomplete information. IEEE Transactions on Systems, Man and Cybernetics, 24(5), 769–777.

    Article  MathSciNet  Google Scholar 

  30. 3GPP (2009) Tr 36.814-further advancements for e-utra: Physical layer aspects, Technical Specification Group Radio Access Network.

Download references

Author information

Authors and Affiliations

  1. College of communications Engineering, PLA University of Science and Technology, Nanjing, 210007, China

    Cheng Ding, Liang Shen, Dianxiong Liu & Yuhua Xu

  2. PLA Academy of National Defense Information, Wuhan, 430010, China

    Kun Xu

Authors
  1. Cheng Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liang Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dianxiong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kun Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yuhua Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuhua Xu.

Additional information

This work is supported in part by the National Natural Science Foundation of China under Grant No. 61401508.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ding, C., Shen, L., Liu, D. et al. A game theoretic learning solution for distributed relay selection on throughput optimization. Wireless Netw 23, 1757–1766 (2017). https://doi.org/10.1007/s11276-016-1250-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-016-1250-y

Keywords

Search

Navigation