Abstract
The emerging device-to-device (D2D) communication paradigm has attracted more and more attention from research and industry, meanwhile social network is penetrating every aspect of our daily lives. However, how to match D2D pairs and spectrum resource in social network remains uncertain. In this paper, we address the D2D user pairing and resource allocation problems in social networks based social-aware by a stable matching approach. The NP-hard joint spectrum allocation problem is formulated as one-to-one matching. Real social network trajectories are used to simulate the social relationships of D2D users. Then, we employ the Gale-Shapley (GS) algorithm to maximize the sum rate of D2D pairs weighted by D2D users' social relationships while guaranteeing user satisfaction. Simulation results show that significant performance gains of the sum rate of D2D pairs and users' satisfaction can be achieved by the proposed algorithm.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
