Research On Multicast Routing Algorithms In Mobile Social Networks

In recent years,with the rapid development of social networks analysis,rapid changes in mobile communication technologies,and the popularity of portable devices such as mobile phones,mobile social networks developed from delay tolerant networks have attracted widespread attention from scholars.It has become one of the most important topics in the fields of mobile communication and social networks.With the effective interconnection of mobile communication and social networks,research on mobile social networks has become increasingly extensive and intensive.Due to the intermittent interruption and dynamic nature of the links of the mobile social networks,messages can only be transmitted through the opportunity contact between nodes,and delivered in a “store-carry-forward” way.Routing function has always been the basis of network technology and information transmission,and it is also the main difficulty of mobile social networks.Although there are many studies on mobile social networks routing algorithms today,most of them focus on unicast routing.Given the high efficiency of multicast technology and the multicast requirements of mobile social networks scenarios,it is necessary to study multicast algorithms.In the real environment,the resources in the network are limited.Therefore,how to effectively use the resources is very important for designing multicast algorithms.This paper is based on the scene of mobile social networks,outlines its architecture and characteristics,and clarifies that its essence is an extension of delay tolerate networks by introducing social attributes into the network.By analyzing the main research fields of current mobile social networks,the existing classical routing algorithms and multicast algorithms are introduced,summarized and classified,and a new multicast routing algorithm is proposed.The main work of this paper is as follows:Firstly,the meaning of the multicast destination group in mobile social networks is analyzed from the semantic level.The message format is designed based on the algorithm.The cooperation of the nodes in the message generation process is mainly discussed.Based on this,the message generation strategy is proposed.In this process,the node cooperates with neighboring nodes with the same requirements in the process of message generation to jointly complete the generation of multicast messages.Secondly,it analyzes the shortcomings of existing algorithms in the selection of multicast relay points and proposes simultaneous considerations.The node's latest communication,node communication frequency and node communication duration completed the multicast relay point selection strategy named new RFD model.Thirdly,taking into account the different properties of the message in the routing algorithm,a message priority queue based on distance difference model,message freshness and importance was proposed.Finally,the parameters of the algorithm are determined and this multicast routing is compared by simulation.This paper proposed a complete multicast routing algorithm by proposing a new message cooperation generation mechanism,a multicast relay point selection strategy based on RFD model and a message priority queue,and carries out simulation verification.