Research On Social-Aware Content Caching And Sharing Methods In Wireless Network

With the popularization of 5G technology,the number of terminals that access wireless communications continues to increase,and the data traffic is also exploding.There is an increasingly shortage of spectrum resources in communications,and the service pressure on core networks and base stations is gradually increasing,as well as consumption.As a key technology in 5G,D2D(Device-to-Device)communication can enable devices to establish end-to-end communication without going through a base station.This technology will play an important role in data offloading and content distribution.Placing popular contents in the cache node in advance and sharing content via D2 D communication is of practical significance for improving the performance of the cellular network.In addition,online social networks connect the network information space with the real information space,and generate a large amount of data containing device holders,so social attributes can assist the establishment of D2 D communication and content sharing process.First of all,this thesis outlines the research background and significance of social attribute-based D2 D communication and caching in wireless communication scenarios,and briefly introduces the current domestic and foreign research status.Common social attributes in wireless communication and key technologies in caching are introduced in detail,as the background support for the following,and the stable matching in the bipartite graph and the Nash equilibrium in the game are introduced as support for the following methods.Secondly,a content sharing method based on matching under mobile VR(Virtual Reality)scenarios is proposed.Facing the high data volume and low latency requirements of mobile VR services,in order to effectively reduce the data traffic of the core network and reduce the cost of the requested content of the equipment,this thesis establishes a partial cache content sharing model for mobile VR,modeling social attribute perception.The content sharing cost minimization problem is divided into two sub-problems of power optimization and mode selection,and device association.The cost-based power optimization and mode selection algorithms and the matching algorithm based on social relationships and request costs are respectively proposed.The simulation results show that the content request mode selection and power optimization scheme based on partial cache proposed in this thesis can effectively reduce the request cost of content requesters.Finally,a content sharing method based on the game theory in the Internet of Vehicles scene is proposed.Facing the characteristics of large data volume and massive connections in the intelligent networked car scenario,in order to achieve safe and efficient driving and reduce data traffic,this thesis constructs a content sharing model in the vehicle network scenario,and models the content based on the social relationship of the vehicle Obtain the cost minimization problem,and transform the optimization problem into a local cooperative cache game problem of vehicles.By analyzing the Nash equilibrium of the game,a local collaborative caching algorithm based on social relations is proposed to obtain the optimal solution of the optimization problem.The simulation results show that the local collaborative caching algorithm based on social relations proposed in this thesis can effectively reduce the content acquisition cost of the entire system and has better convergence.There are 21 figures,4 tables and 76 references in this thesis.