Potential games for subcarrier allocation inmulti-cell networks with D2D communications
2016 (English)In: IEEE International Conference Communications, IEEE , 2016Conference paper (Refereed)
This paper investigates the subcarrier allocationproblem for uplink transmissions in a multi-cell network, wheredevice-to-device communications are enabled. We focus on maximizingthe aggregate transmission rate in the system accountingfor both inter- and intra-cell interference. This problem iscomputationally hard due to its nonconvex and combinatorialnature. However, we show that it can be described by a potentialgame, and thus a Nash equilibrium can be found using iterativealgorithms based on best/better response dynamics. In particular,we propose a simple iterative algorithm with limited signalingthat is guaranteed to converge to an equilibrium point, correspondingto a local maximum of the potential function. Usingextensive simulations, we show that the algorithm convergesquickly also for dense networks, and that the distance to the trueoptimum is often small, at least for the small-sized networks forwhich we were able to compute the true optimum.
Place, publisher, year, edition, pages
IEEE , 2016.
IdentifiersURN: urn:nbn:se:kth:diva-189161OAI: oai:DiVA.org:kth-189161DiVA: diva2:943681
IEEE International Conference Communications, ICC 2016,Kuala Lumpur
QC 201606292016-06-282016-06-282016-06-29Bibliographically approved