A Node Compact Effect-based Routing Algorithm In Mobile Social Networks

Disruption tolerant networks(DTNs)are new type of networks with intermittent connections between nodes.The characteristics of the lack of end-to-end paths make the traditional routing algorithms difficult to apply directly in DTNs.With the popularity of smart device,human-carried mobile devices become the primary means of communication.As an important application of DTNs,MSNs has significant research value,especial y the data forwarding algorithm in MSNs.First,this thesis investigates related concepts,the architecture,network characteristics,forwarding mechanism,mobile models in MSNs and some typical data forwarding routing algorithms of MSNs.Then,the basic knowledge of the matrix,the functional relationship between the adjacency matrix of the complex network and various characteristics of the network,and the matrix expression form of the node importance are introduced.Finally,based on the connections between a node and its neighbor nodes and the secondary neighbor nodes(the neighbor nodes of its neighbor nodes),this thesis proposes a node compact effect-based routing(NCER)algorithm in MSNs.When designing the routing algorithm,the indirect contact interval between the node and the secondary neighbor node is firstly derived.We then obtain the probability of encounter between nodes through their historical encounters.Furthermore,we use the matrix knowledge to derive the probabilistic interval matrix of the nodes,and then define the compact effect metric of node which can be used to decide whether to choose a node as the relay node.The simulation results show that,compared with Epidemic algorithm and Prophet algorithm,the proposed algorithm can reduce the consumption of network resources and significantly improve the delivery ratio of message.