M. I. Ashraf, M. Bennis, W. Saad, M. Katz and C. Hong, "Dynamic Clustering and User Association in Wireless Small-Cell Networks With Social Considerations," in IEEE Transactions on Vehicular Technology, vol. 66, no. 7, pp. 6553-6568, July 2017. doi: 10.1109/TVT.2016.2644760
Dynamic clustering and user association in wireless small-cell networks with social considerations
|Author:||Ashraf, Muhammad Ikram1; Bennis, Mehdi1,2; Saad, Walid3,4;|
1Centre for Wireless Communications, University of Oulu, Oulu 90014, Finland
2Department of Computer En- gineering, Kyung Hee University, Seoul 02447, South Korea
3Wireless@VT, Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA 24061 USA
4Department of Computer Engineering, Kyung Hee University, Seoul 02447, South Korea
|Online Access:||PDF Full Text (PDF, 1.7 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2018080133233
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2018-08-01
In this paper, a novel social network-aware user association in wireless small cell networks with underlaid deviceto-device (D2D) communication is investigated. The proposed approach exploits strategic social relationships between user equipments (TIEs) and their physical proximity to optimize the overall network performance. This problem is formulated as a matching game between TIEs and their serving nodes (SNs) in which, an SN can be a small cell base station (SCBS) or an important UE with D2D capabilities. The problem is cast as a many-to-one matching game in which TIEs and SNs rank one another using preference relations that capture both the wireless aspects (i.e., received signal strength, traffic load, etc.) and users’ social ties (e.g., TIE proximity and social distance). Due to the combinatorial nature of the network-wide TIE-SN matching, the problem is decomposed into a dynamic clustering problem in which SCBSs are grouped into disjoint clusters based on mutual interference. Subsequently, an TIE-SN matching game is carried out per cluster. The game under consideration is shown to belong to a class of matching games with externalities arising from interference and peer effects due to users social distance, enabling TIEs and SNs to interact with one another until reaching a stable matching. Simulation results show that the proposed social-aware user association approach yields significant performance gains, reaching up to 26%, 24%, and 31% for 5th, 50th, and 95th percentiles for TIE throughputs, respectively, as compared to the classical social-unaware baseline.
IEEE transactions on vehicular technology
|Pages:||6553 - 6568|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work was supported in part by TEKES Grant 2364/31/2014 and the Academy of Finland (CARMA) and the National Science Foundation under Grant CNS-1513697 and Grant CNS-1460316.
|Academy of Finland Grant Number:||
294128 (Academy of Finland Funding decision)
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.