Research And Implementation Of Routing Detection Mechanism In Mobile Social Network

With the development of science and technology, the portable terminal has become increasingly common in today’s society. More and more people access the Internet through the mobile terminal. The development of intelligent terminal technology and mobile communication technology, providing people with more convenience, create more opportunities for network and communications applications. Mobile social networks (mobile social network, MSN) are increasing attention from industry and academic.Mobile social network conforms to the trend of the Internet and the integration of personal mobile communications, designed to provide people with better and convenient Internet experience. Currently, the hot problem in mobile social network is how to find routing in the network, and then make message forwarding.The network connection of mobile social network is in terms of delay tolerant network characteristic. In the network, the network characteristic between the nodes is intermittent connection, limited resource and no guarantees delay. Therefore, in the mobile social networks, if it directly transmit message between nodes, it cannot use traditional network transmission strategy. In delay tolerant networks, messages are transmitted by "store-carry-forwards".Based on the analysis of existing message forwarding algorithms, this thesis uses the multi-dimensional view study the social characteristics between nodes in the network, constructing a mobile social network routing detection mechanism. In the social contact layer, this thesis proposed the concept of node activity. In social relation layer, through the establishment of topological relationship between nodes, this thesis presents a method for detecting the local community. Finally, in the social evaluation layer, the thesis considered multidimensional feature of nodes and networks designed routing detection mechanism. The algorithm uses PageRank algorithm to evaluate nodes, and then it is converted to encounter node utility value. In actual message transmission process, routing mechanism considers both community relations between nodes and node utility value, it determines whether the message is transmitted to the encounter node, so that it achieves successful transmission of messages.This thesis uses ONE simulation platform for analysis and simulation. It compares the algorithm proposed in this thesis with existing algorithms based on datasets to evaluate the performances and effectiveness. Experimental results show that our algorithm can achieve better delivery ratio and lower average delay.