Bipartite Graph-based Routing in DTN
Lin Chao-ju · Journal of Fujian Normal University · 2014
Due to the lack of stable end-to-end transmission path in DTN,in order to improve the transmission efficiency of the routing protocol,reducing network latency and overhead,it is mainly by adding its redundant packet pair.But the traditional DTN routing protocol can't effectively control the number of packet copies,eventually leads to routing performance reduction.Since each node in DTN has the characteristic of social feature,it makes that the movement of nodes has a certain regularity and stability.This paper firstly analyzes the information exchange relationship between nodes,proves that there exists the property for binary chart in DTN.Secondly,we put forward the bipartite graph-based routing protocol in DTN,and then give the optimal routing algorithm directly with time factor taken into account.Finally,it gives the simulation experiment results.