Research On Mobile Model And Routing Algorithm In Distributed Mobile Social Networks

The rapid development of the Internet industry,large-scale popularization of intelligent mobile terminal equipment,extensive application of 3G and 4G communication technology,promoted the natural combination of social networks and mobile terminal,and distributed mobile social networks came into being.Distributed mobile social networks is a kind of special delay tolerant network which combines human mobility,sociality and wireless communication technology.But in this network,because of the mobility and intermittent connection of the node,it brings great challenge to information transmission.In order to promote the application and development of distributed mobile social networks,it is very important to design a mobile model which can reflect the real movement of people and an efficient routing algorithm.They are also the main content of this paper.In order to design a mobile model which can reflect the real movement of people,firstly,this paper makes a statistical analysis on the Dartmouth/campus data set,and concludes that in real life,people move in a fixed place for most of the time.Based on this feature,this paper extends the concept of home,home no longer refers only to the place where people live,but the place where people often visit.And then designs a Home-based Mobile Model-HBMM.In HBMM,we firstly collect the trajectories of people for a period of time,and then determine the set of people's homes,calculate the residence time and moving probability between the home according to the collected data,finally form the Markov state transition diagram.In the state transition diagram,people move with each other within the set of the home with larger probability,and move to other infrequent places with less probability.The state transition diagram can be used to predict the moving trajectories of people over a long period of time.And numerical simulation results show that the model can accurately reproduce the actual movement of people.In order to improve the efficiency of message forwarding in distributed mobile social networks,three home-based multi-copy routing algorithms,HBMRZ,HBMRA and HBMR,are designed on the basis of mobile model.In HBMRZ,we assume that the message holders do not know the home information about the destination,in order to improve the success delivery ratio of the message,the optimal relay selection strategy is designed in this paper,which can make the coverage of all relay nodes most widely.In HBMRA,we assume that the message holders know the home information about the destination.In this case,we will select those nodes with high similarity to the destination as the relay.HBMR is a kind of actual situation,each node establishes a home information table which is similar to the routing table,and when nodes meet each other,they will exchange and update theirs' tables.When nodes forward message,they can obtain the home information about the destination through the table.Numerical simulation results show that the three algorithms are superior to the traditional multi-copy algorithms Spray&Wait and HS,and the performance of HBMRA is much better than HBMRZ?the performance of HBMR is close to HBMRA.