Study On Ferrying Routing Algorithm In Disruption Tolerant Network

Disruption Tolerant Network(DTN) provides a basic communication means for challenging networking enviroment,as well as interoperability between different networks. As a new type of network architecture,the theory of DTN is also not enough mature. DTN routing forwarding scheme is a research hot spot, and is also difficult.First of all, this article focus on the Message Ferrying Approach in scenes of the DTN network , analysis several major ferrying route mechanism;After that,gives my own improvement program contrary to these routing mechanisms; Finally, designs a simple multi-node ferrying routing algorithm. The main works are as follows:①An improved program named MO-FIMF, was proposed for FIMF-NN algorithm..Under the algorithm of FIMF-NN ,when Ferry node receives a number of service message request from DTN nodes,every time, the Ferry node will go to the nearest DTN node to communication, but for the MO-FIMF algorithm,the ferry node will chooses the DTN node with the largest data to transfer as the visiting object. And prove the superiority of the improved algorithm through simulation experiment.②An improved program named MO-EZF, was proposed for EZF algorithm.For the EZF algorithm not well consider in the field of how ferry node to receive bundle from source DTN node, MO- EZF algorithm gives a improved way:according to the thinking of messaging-oriented,the ferry node will choose the source DTN node with the largest messages to visit,and according to the idea of elliptical zone forwarding,the ferry node will select the an intermediate DTN node to visit and then go to destination DTN node. And through simulation experiments,verify the effectiveness of the improvement program.③A simple multi-ferries program named MFMFS was proposed..Du to a single ferry node have limit network performance, and subject to real-life transport hub inspired , design a simple multi-ferries routing scheme:intorduct two types of ferry node in DTN,they have different cache capacity and mobility rate and service in different network nodes. Through simulation experiments prove that MFMFS routing algorithm has better network performance than FIMF, EZF algorithm.