| Title | Game-Theoretic User Association in Ultra-dense Networks with Device-to-Device Relays |
| Authors | Li, Geng Zhao, Yuping Li, Dou |
| Affiliation | Tongji Univ, Dept Comp Sci, Shanghai, Peoples R China. Yale Univ, Dept Comp Sci, POB 2158, New Haven, CT 06520 USA. Peking Univ, Sch Elect Engn & Comp Sci, Beijing, Peoples R China. Tongji Univ, Dept Comp Sci, Shanghai, Peoples R China. Li, G (reprint author), Yale Univ, Dept Comp Sci, POB 2158, New Haven, CT 06520 USA. |
| Keywords | D2D relay Ultra-dense network User association Load balancing Hedonic coalition game HETEROGENEOUS NETWORKS COMMUNICATION OPTIMIZATION ALLOCATION MOBILE |
| Issue Date | 2017 |
| Publisher | WIRELESS PERSONAL COMMUNICATIONS |
| Citation | WIRELESS PERSONAL COMMUNICATIONS.2017,95(3),2691-2708. |
| 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. |
| URI | http://hdl.handle.net/20.500.11897/471796 |
| ISSN | 0929-6212 |
| DOI | 10.1007/s11277-017-3950-8 |
| Indexed | SCI(E) |
| Appears in Collections: | 信息科学技术学院 |
