Research On Resource Allocation For D2D Communications Based On Social Networks

As the amount of mobile data traffic and devices has grown explosively,traditional cellular network faces great challenges as well as the chances of evolution.Device-to-Device(D2D)communication technology is proposed to enable users to communicate with each other directly,without the need of going through the Base Station(BS),which completely changes the data transmission and data processing mode of cellular network,and alleviates the burden of core network.In detail,the spectral efficiency and network capacity can be efficiently improved while reducing energy consumption and transmission delay.Moreover,the ubiquitous mobile devices bring convenience for users to build and expand their social connections in social networks.The user-oriented information in social networks can boost the efficiency of establishing D2 D connections through analyzing and utilizing the social relationship,behavior and regularity among users.Therefore,introducing social networks into D2 D communications becomes an innovative and feasible approach to resolve the key issues of D2 D communications.In this context,based on user's social trust,content selection preference and satisfaction in the social networks,this thesis studies the resource allocation for D2 D communications.Details of the main work are as follows:1)Research on the device and power resource allocation for D2 D communications based on social trust.Leveraging social trust,an innovative social-aware energy-efficient relay device selection(SERS)algorithm is proposed.The SERS considers the hidden social relationships among mobile users to ensure that more users are willing to participate in the cooperative D2 D communications.This algorithm takes both social and physical constraints into account to determine the best choice of relay devices.Moreover,an optimization problem based on game theory is further developed,aiming at reducing energy consumption and interference.In the game,social distance is treated as a penalty coefficient,and it performs distributed control of the transmission power.Simulations based on real-world social network data traces show that SERS achieves a significant performance gain,compared with other relay device allocation approaches.2)Research on the device,channel and power resource allocation for D2 D communications based on content preference.Jointly taking social network and physical network into consideration,the optimized D2 D pair matching,channel and power resource allocation algorithm based on content preference are proposed.The probability of user behavior(choosing similar content)is modeled by Dirichlet process,and is treated as constraint and weight coefficient to respectively represent the social networks' influence on D2 D pair matching and resource allocation.In the downlink resource allocation,different quality of service(QoS)requirements of D2 D pairs and cellular users are considered.In that case,the resource allocation problem is formulated into a mixed integer nonlinear programming(MINLP)problem with the objective to maximize the overall wighted data rate.Then,a one-to-one stable matching algorithm is used to optimize resource allocation results.Furthermore,the stability,optimization and complexity of the proposed algorithms are analyzed.Finally,extensive simulation results demonstrate that the proposed algorithms can significantly improve the pair matching successful rate and data rate.3)Research on the channel and power resource allocation for D2 D communications based on satisfaction.Based on the content preference model of social networks,an iterative resource allocation algorithm that jointly considers channel resource allocation and power resource allocation is proposed.The joint problem of channel and power allocation is modeled as a MINLP problem with the objective to guarantee QoS requirement and maximize the overall weighted data rate of D2 D pairs.Dividing the joint problem into two subproblems,one of the subproblems is solved by a many-to-one stable matching algorithm based on the users' satisfaction;the other one is solved by a power control algorithm based on Stackeberg game.Finally,the iterative resource allocation algorithm that combines the two algorithms is proposed to achieve the joint solution of the optimization objective.Moreover,the stability,optimization and complexity of the proposed algorithms are analyzed.The efficiency and outperformance of the proposed algorithms are verified by comparison of different performance indexes under different situations.