Social-aware D2D Communication Networks Resource Allocation

As one of the key technologies for solving the cellular network capacity problem in the 5thgeneration,device to device(D2D)technology can provide a variety of services for the massive terminals.However,while D2 D technology brings potential performance gains,it also encounters many technical challenges.On one hand,due to the D2 D communication systems reuse the spectrum resources of the cellular systems,the complex interference problem is introduced;on the other hand,in order to cope with the massive data traffic,it is necessary to further guarantee and improve the quality of service(QoS).The terminal device is often carried and operated by humans and has some social network characteristics indirectly,which can be used to enhance the performance of the D2 D communication systems.Therefore,this thesis studies the joint user pairing and resource allocation with social awareness at first;furthermore,the problem of massive D2D's clustering with social awareness is studied.Aiming at establishing a stable and efficient user pairing,improving the QoS and enhancing the system performance with lower overhead.The main research contents are summarized as follows: 1.This thesis summarizes the advantages and challenges of D2 D communication technologies,introduces the relevant features of social networks and game theory,and investigates the existing research of D2 D with social networks,which pave the way for the latter.2.To solve the problems of low transmission efficiency and serious interference in the transmission process of D2 D communications,based on the game theory,a joint user pairing and resource allocation algorithm(JURA)with social awareness is proposed.On one hand,a social relationship representation function,which includes the degree of connection,interest similarity,social trust,and physical distance,is designed.On the other hand,based on the matching game theory and social awareness,the JURA algorithm selects the appropriate D2 D user to form a stable and efficient D2 D user pair.Furthermore,based on the overlapping coalition game theory and the received signal strength,the D2 D pairs form the coalition.Under the condition of ensuring the QoS of cellular users,the coalition's D2 D reuses the same spectrum resources to maximize the spectrum utilization.3.To solve the heavy signaling overhead problem under large scale D2 D network,this thesis studies the clustering problem under massive D2 D communication with social awareness.Based on the theory of coalition game,a distributed coalition game clustering algorithm(CGC)is proposed,taking into account the utility and cost.Under the lower signaling overhead,the user utility is maximized.4.This thesis uses Matlab tool to simulate the paper algorithm and the existing algorithm.The simulation results demonstrate that,compared with the physical distance spectrum sharing algorithm and the non-spectrum sharing algorithm,the proposed JURA algorithm can increase the average user utility about 57% and 95% respectively.Compared with the physical distance cooperative algorithm and non-cooperative algorithm,the proposed CGC can increase the average user utility about 19.3% and 98% respectively.