Research Of End-to-End Routing Algorithm In Mobile Social Network

Mobile Social Networks are a sort of people-oriented Delay Tolerant Networks.Compared with the traditional network,it inherits the typical features of DTN,e.g.,intermittent network connection,high transmission delay,limited node resources,convenient networking and so on.The movement of nodes in MSN is influenced by the environment in which people are located and the influence of social circles,showing a unique sociality that can help to design routing algorithms.This thesis analyzes this social relation through social attributes.At present,a large number of studies have only qualitatively analyzed the influence of social attributes on the behavior of nodes,while the quantitative analysis of the impact on them has been relatively small.In addition,the current part of the routing algorithm based on social utility ranking does not consider the problem of node load imbalance.In this kind of algorithm,the node's load increases as the rank increases.Under resource-constrained conditions,this part of the high-load nodes can quickly run out of resources and thus exit the network,adversely affecting the performance of route algorthm.This thesis focuses on the research of routing algorithms for end-to-end and multihop data transmission in a distributed mobile social network consisting of a large number of handheld short-range communication devices.The research contents are mainly divided into three parts: the analysis of social relations among nodes,the influence of social relations on message transmission and the routing algorithm,as follows:(1)Through the statistical analysis of the social attributes and the encounter information,this thesis expatiates macroscopically the positive influence of the matching degree of the social attributes on the contact of the nodes;then filters out the representative sets of social attributes and calculates their weights;finally,similarity calculation is performed on node pairs by attribute weights to quantify the strength of social relationships.(2)According to social strength,the social relationship is divided into three categories: strangers,familiar strangers and friends.Then this thesis analyses which role these three types of social relations play in flooding-based route and greedy-based route.(3)Proposed a Social Relations based Routing algorithm.In the delivery process,different delivery strategies are implemented according to the social relationships between nodes.In order to reduce the delivery delay,a multi-copy strategy is used and multiple links can simultaneously deliver messages,which spreads the message to the destination node faster.In the statistical analysis,it is observed that the number of encounters of some nodes with other nodes during a certain period of time is very small,resulting in a significant increase of delivery delay of messages held on these nodes.In order to improve the adverse effects of these "lazy nodes",the node activity index is introduced so that the messages can bypass the less active nodes;finally,for different scenarios,the social relationship strength and activeness are dynamically adjusted in the decision formula by the coordination factor.SRR compared to the flooding strategy-based routing,controls the number of copies distributed through social relationships,significantly reducing the network overhead,while affecting the message delivery delay performance less.Compared to greedy strategies based routing,SRR makes full use of every node in the network to delivery message,which improves the load balance of the nodes.(4)Simulation experiments are carried out on the algorithm proposed in this thesis,and compared with other types of mainstream algorithms in terms of delivery delay,relay hop count,network overhead,and node load balancing.The simulation results show that the algorithm has a good performance in delivery delay and node load balance.