Delay Tolerant Network Routing Algorithms

Comparing with the Internet that people are familiar with in their dailycommunication, networks with harsh environment such as remote rural networks,disaster recovery network, and interplanetary network are not well known. In suchnetworks, nodes do not have contemporaneously end-to-end connections, intermittentconnections instead. Because of that, delivery probability in such networks is low andnetwork delay latency is high. Those characteristics are abstracted by Scientists andresearchers, and called Delay tolerant network (DTN).Similar with traditional network research, routing algorithm study has becomingcentral issue ever since new DTN network architecture were proposed. Focusing onresearch of routing algorithm in DTN, two creative algorithms—EROD (Energy-awarerouting in opportunistic DTN) and Social Based Routing are proposed in this thesis afterin-depth study of DTN lately routings.Firstly, the existing routing protocols are surveyed and a comparison of them withrespect to the important challenging issues and performance metrics is given in thisthesis. Secondly, new routings (EROD and POIAwareRouter) are proposed after thesummary of key points of the routing design. Then, these two algorithms are deployedon a carefully chosen routing simulation platform--ONE. And the specific processes ofimplement are explained in detail. Lastly, routing simulation results of these twoalgorithms, Epidemic routing, Prophet routing and Spray-and-Wait routing are shownand analyzed in the end of this thesis. Taking equity into account, Epidemic, Prophetand Spray-and-Wait are re-deployed on ONE according to original codes on othersimulators. And all these five routings are tested in the same designed DTN scenarios.Simulation results have verified the performance supremacy of EROD andPOIAwareRouter. In this thesis, routing designing method and routing algorithms arecreative. And this thesis would be helpful for future work on DTN routing research.