Research On Data Forwarding Algorithm Based On The Group Of Nodes In Mobile Social Networks

The Delay Network (Delay Tolerant Network, DTN) refers to a special kind of wireless network. Mobile social network is an important application of DTN. Mobile social network communication is made by people through WIFI,4 G and blue-tooth which based on intermittent connection to realize the data communication between network devices. With the rapid development of Internet, especially with the mature of 4G technology,5G technology research, and the popularity of smart phones, mobile social network users has increased year by year. It lets the mobile Internet rapid development. In today, people always exchange with each other every moment. Increasingly important role in the social life of relationship, how to effectively use the existing social relation network is the modern talents must master skills. Recently, utilizing the friendship of nodes to realize data forwarding algorithm research is a hot topic in mobile social network.In this thesis, it first introduces the development of mobile social networking, the basic characteristics of mobile social network, several common types of mobile social network and several data forwarding algorithm based on typical social attribute in mobile social network. Then, based on the friendship of nodes, this thesis first constructs the groups of nodes and then utilizes the intimacy of groups with nodes and communications to propose a data forwarding algorithm based on intimacy of group (DFAIG). The idea of DFAIG is that packet carrier only copies to its communication AP or the encounter node whose intimacy with the destination node’s group meets a certain requirement. The simulation results show, our algorithm has obvious superiority on reduce network overhead and also can significantly increase delivery ratio compared with Epidemic algorithm, Label and SGBR algorithm.Based on the intimate of group model, this thesis continues to segment on network, and constructs the two level of community model. Through estimating the friendship between nodes, this thesis divide the nodes which are friends with each other into the same small communities. But due to the diverse friendship of nodes, small communities maybe overlap with each other. Therefore, based on the relationship of small community, and the number of nodes in the overlapping small community to build the network. Finally based on the two level of community model, we propose a new data forwarding algorithm TLCR. The simulation results show that TLCR not only improves the delivery ratio but also greatly reduces the resource cost.