Research On Routing Mechanism In Mobile Social Networks

With the popularization of mobile smart devices and the development of communication technology,the Internet has gradually changed from a fixed end to fixed end communication link to a mobile to mobile communication link.People's various demands for network services are increasing day by day,which makes the opportunity network come into being.The opportunistic network uses the "storage-carry-forward" mode for communication.It is a self-organizing network that does not require a complete path between the source node and the destination node,and relies on the encounter opportunities brought by node movement to achieve communication.With the deepening of research,many scholars have discovered that human beings,as the carrier of mobile smart devices,inevitably make the nodes in the opportunistic network have certain social attributes.Specifically,the closely connected nodes meet more frequently,while the distant nodes meet more rarely.Therefore,some scholars proposed mobile social networks.On the basis of the opportunistic network,the mobile social network additionally considers the social attributes of the nodes,and decides whether to forward the message or not,thereby improving the overall performance of the network.This paper mainly studies the routing mechanism in mobile social networks,and the main work is as follows:Firstly,in order to improve the forwarding efficiency of opportunistic networks,this paper proposes a Constrained Diffusion routing algorithm considering Encounter Intensity(EICD).Aiming at the low delivery rate caused by inaccurate prediction in probabilistic routing,the algorithm presents the encounter intensity and its calculation formula.The encounter intensity takes time as an important basis for calculation,which can more accurately reflect the possibility of the next encounter between two nodes.At the same time,for the problem that too many copies of messages and redundant copies of delivered messages occupy a lot of network resources in multi-copy algorithms,two methods of constrained diffusion and deredundancy are used to reduce network load and forwarding delay.Simulation results show that the EICD algorithm can improve message delivery rate and reduce network load and forwarding delay compared with classical routing algorithms.Secondly,aiming at the disadvantage of blind message forwarding in mobile social network,a routing strategy based on optimal path analysis(OPA)is proposed.Based on the real-time encounter intensity between two nodes,the algorithm constructs a real-time encounter intensity matrix.At the same time,it considers the social attributes of the nodes and uses the "small world characteristics" to limit the number of hops of the message,so as to pre-select multiple optimal path to help the message choose the appropriate intermediate node to assist in forwarding.The simulation results show that OPA algorithm has better performance than EICD algorithm and other exsiting routing algorithms in terms of message delivery rate,network load and average forwarding delay.