Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (5): 28-32.doi: 10.13190/jbupt.201005.28.liuql

• Papers • Previous Articles     Next Articles

Solving the Routing Problems in Delay Tolerant Networks by HTC

  

  • Received:2009-10-21 Revised:2010-04-01 Online:2010-08-28 Published:2010-06-15

Abstract:

The traditional shortest path algorithm is not suitable for the routing choice in delay tolerant networks (DTN). According to the routing features in DTN,a new shortest path algorithm hopbased, timevarying cost (HTC) is proposed based on the hop and the cost varied with the time. The design of the routing algorithm not only considers the space factor between the nodes in DTN, but also the time factor of the wireless links and the complexity and accuracy. Simulation compared with the existing routing algorithm such as first contact (FC), minimum expected delay (MED), indicate that the algorithm proposed by this paper is more effective to get the shortest path.

Key words: delay tolerant network, routing, Floyd, hopbased timevarying cost