Potential games for subcarrier allocation in multi-cell networks with D2D communications
2016 (English)In: 2016 IEEE International Conference on Communications, ICC 2016, IEEE conference proceedings, 2016Conference paper (Refereed)
This paper investigates the subcarrier allocation problem for uplink transmissions in a multi-cell network, where device-to-device communications are enabled. We focus on maximizing the aggregate transmission rate in the system accounting for both inter- and intra-cell interference. This problem is computationally hard due to its nonconvex and combinatorial nature. However, we show that it can be described by a potential game, and thus a Nash equilibrium can be found using iterative algorithms based on best/better response dynamics. In particular, we propose a simple iterative algorithm with limited signaling that is guaranteed to converge to an equilibrium point, corresponding to a local maximum of the potential function. Using extensive simulations, we show that the algorithm converges quickly also for dense networks, and that the distance to the true optimum is often small, at least for the small-sized networks for which we were able to compute the true optimum.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2016.
Device-to-Device, Nash equilibrium, potential games, Subcarrier allocation, Algorithms, Computation theory, Game theory, Device-to-Device communications, Extensive simulations, Inter and intra-cell interference, Nash equilibria, Sub-carrier allocation, Up-link transmissions, Iterative methods
IdentifiersURN: urn:nbn:se:kth:diva-197161DOI: 10.1109/ICC.2016.7511458ScopusID: 2-s2.0-84981308707ISBN: 9781479966646OAI: oai:DiVA.org:kth-197161DiVA: diva2:1055822
2016 IEEE International Conference on Communications, ICC 2016, 22 May 2016 through 27 May 2016
QC 201612132016-12-132016-11-302016-12-13Bibliographically approved