DTN Routing Algorithm Based On The Union Probability

With the development of mobile devices and wireless network technology, Delay Tolerant Network has increasingly attracted widespread attention. Traditional DTN routing has not been suitable for a network environment, especially like the military self-organizing network, Star network, wireless sensor networks, whose are prone to lost connection and difficult to exist stable connection between the source and destination nodes.As location node in DTN is changing constantly(that is network topology changes dynamically), it makes the nodes possess characteristics of intermittent connectivity, packet transmission delay and asymmetrical data transmission. Traditional routing protocols to DTN has ever been proposed such as Epidemic, Spray and Wait, Max Pro, etc. Which are predictable because people or other mobile device for node carriers’ movement have linked inextricably the human social activity in social networking.First of all, the thesis analyze the characteristics and shortcomings of traditional DTN network. Then, followed by the social network, this special DTN networks have been studied in the current research DTN social network which given systematic analysis of the sociological characteristics of the human formalized expression. Mobile node mobility model will no longer follow a random pattern analysis, but simulate in accordance with the regional characteristics of social activity. Some nodes move only in one area, while other nodes can move back and forth between multiple regions. We ultimately come up with a new partition DTN routing algorithm-the joint probability route. It combines the advantages of MRS SA routing algorithm and routing algorithm.Comparing size of the union probability nodes within communication range (UP), it select the forwarding probability node the forwarding nodes for packet forwarding. Simulation results show that, UP routing algorithm, compared with several other algorithms, has been improved in network latency and overhead. Research programs and contents as follows:1. Introduction of DTN network’s background and process of its development, a detailed description of the DTN network characteristics, and architectures, analysis of the traditional DTN routing algorithms and respective advantages and disadvantages.2. The current social networks research situation in DTN environment were described respectively and analyzed according to a series of problems. The concept of union probability social network routing algorithm were put forward and forwarding model was established, then choose the joint probability value that is large as the next hop node of the forwarding node by comparing the size of node union probability from communication.3. Simulation experiment was concluded by using THE ONE simulation tools to make comparison among the union probability routing algorithm and traditional Epidemic, Spray and Wait, PROPHET. As a result, the performance of simulation results show that the union probability routing algorithm exhibits more excellent features.In summary, this thesis analyze and raise a new solution to packet forwarding information strategy in the social network, which has some theoretical value and significance for further research and development DTN network.