Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Self-organising multiuser matching in cellular networks: a score-based mutually beneficial approach

In this study, the authors study the self-organising user assignment problem for the multi-user cooperation network. In the cellular network with user cooperation, idle users near the base station are seen as potential relay nodes, which can assist cell edge users to transmit data. Practically, the selfish nature of users is considered in the authors’ model. They design a score-based system, where the strategies of relay assignment are affected by the historical behaviours of users. That means not only the transmission performance, but also the accumulative contributions of users are considered. The proposed score-based system sufficiently encourages idle users to assist active users. Furthermore, the multi-user assignment problem is formulated as a one-to-one matching game, in which idle users and active users rank one another individually based on their own preference. To address the issue, they propose a self-organising mutually beneficial matching algorithm, which is proven to converge to a stable matching. Simulation results show that the proposed distributed algorithm yields well matching performance between source users and relay users, which is close to the optimal centralised results.

References

    1. 1)
    2. 2)
      • 7. Xu, H., Huang, L., Qiao, C., et al: ‘Shared relay assignment (SRA) for many-to-one traffic in cooperative networks’, IEEE Trans. Mob. Comput., 2015, PP, (99), pp. 11.
    3. 3)
      • 10. Comaniciu, C., Mandayam, N.B., Poor, H.V.: ‘Radio resource management for green wireless networks’. Proc. IEEE VTC-Fall, Anchorage, Alaska, USA, September 2009, pp. 15.
    4. 4)
      • 14. Roth, A.E., Sotomayor, M.A.O.: ‘Two-sided matching: a study in game-theoretic modeling and analysis’ (Cambridge University Press, 1992).
    5. 5)
    6. 6)
    7. 7)
    8. 8)
      • 17. Semiari, O., Saad, W., Valentin, S., et al: ‘Matching theory for priority-based cell association in the downlink of wireless small cell networks’. IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP), 2014, pp. 444448.
    9. 9)
    10. 10)
    11. 11)
      • 4. Nokleby, M., Aazhang, B.: ‘User cooperation for energy-efficient cellular communications’. IEEE Int. Conf. on Communications (ICC), 23–27 May 2010, pp. 15.
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
      • 3. Majid, J., Reza, P.M., Hanie, S.: ‘A game-theoretic approach for power allocation in bidirectional cooperative communication’. Proc. IEEE WCNC, April 2010, pp. 16.
    17. 17)
      • 16. Namvar, N., Saad, W., Maham, B., et al: ‘A context-aware matching game for user association in wireless small cell networks’. IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP), 2014, pp. 439443.
    18. 18)
    19. 19)
    20. 20)
    21. 21)
      • 9. Yang, D., Fang, X., Xue, G.: ‘OPRA: optimal relay assignment for capacity maximization in cooperative networks’. IEEE Int. Conf. on Communications (ICC), 2011, pp. 16.
    22. 22)
      • 24. Kazmi, S.M.A., Tran, N., Saad, W., et al: ‘Optimized resource management in heterogeneous wireless networks’, IEEE Commun. Lett., 2016, 20, (7), pp. 13971400.
    23. 23)
      • 27. 3GPP TR 36.814: ‘Further Advancements for E-UTRA: Physical Layer Aspects’, Technical Specification Group Radio Access Network, June 2009.
    24. 24)
      • 26. Bodine-Baron, E., Lee, C., Chong, A., et al: ‘Peer effects and stability in matching markets’. Proc. 4th Symp. Algorithmic Game Theory, 2011, pp. 117129.
    25. 25)
    26. 26)
    27. 27)
      • 18. Pantisano, F., Bennis, M., Saad, W., et al: ‘Matching with externalities for context-aware user-cell association in small cell networks’. IEEE Global Communications Conf. (GLOBECOM), 2013, pp. 44834488.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2016.0129
Loading

Related content

content/journals/10.1049/iet-com.2016.0129
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address