Column Generation Algorithm-Based DTN Routing Strategy in Complex Data Transmission Scenario

An ideal routing strategy shall be able to help the delay tolerant network (DTN) achieve an optimal transmission performance under the premise of lower energy consumption. However, due to the diverse of the application scenarios, it is hard to use one or more types of routing strategies as a universal optimum solution. There is a need to establish a routing strategy model of the corresponding DTN network for different application scenarios, analyze and evaluate the strategy model in combination of the knowledge of the operational research and statistics. For a complex data transmission DTN network scenario, with the introducing of a line programming method, the big-data and multi-node network transmission problem can be abstracted to a large-scale line programming problem. In this paper, the feasibility of solving the large-scale line programming problem by the column generation algorithm has been analyzed, and a column generation algorithm-based DTN routing strategy under the complex data transmission scenario has been designed. This routing strategy can realize the quantization of the routing strategy performance by the column generation algorithm. Also, by the simulation experiments, the performance of complex data transmission DTN routing strategy under different factors has been analyzed, and the performance of the column generation algorithm-based DTN routing strategy has been compared with the performance of the traditional jet waiting routing strategy.

[1]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

[2]  Jingfeng Xue,et al.  Advanced PROPHET Routing in Delay Tolerant Network , 2009, 2009 International Conference on Communication Software and Networks.

[3]  Kevin C. Almeroth,et al.  ParaNets: A Parallel Network Architecture for Challenged Networks , 2007 .

[4]  Kevin Fall,et al.  A linear programming formulation of flows over time with piecewise constant capacity and transit times , 2003 .

[5]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[6]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[7]  Jingfeng Xue,et al.  Spray and Wait Routing Based on Average Delivery Probability in Delay Tolerant Network , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.

[8]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[9]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[10]  Merkourios Karaliopoulos,et al.  Trace-based performance analysis of opportunistic forwarding under imperfect node cooperation , 2012, 2012 Proceedings IEEE INFOCOM.

[11]  Chin-Tser Huang,et al.  Look-ahead routing and Message Scheduling in delay-tolerant networks , 2010, IEEE Local Computer Network Conference.

[12]  Jean-Yves Le Boudec,et al.  Traps and pitfalls of using contact traces in performance studies of opportunistic networks , 2012, 2012 Proceedings IEEE INFOCOM.

[13]  Kun Yang,et al.  A Random Road Network Model and Its Effects on Topological Characteristics of Mobile Delay-Tolerant Networks , 2014, IEEE Transactions on Mobile Computing.