I. Chlamtac, A. Farag’o, H. Zhang and A. Fumagalli, “A Deterministic Approach to the end-to-end Analysis of Packet Flows in Connection Oriented Networks,” IEEE/ ACM Transactions on Networking, Vol. 6, 1998, pp. 4422-4431.

has been cited by the following article:

• TITLE: Transmission Scheduling Algorithm in DTN

  AUTHORS: Wei Yu, Hongyan Li, Jiandong Li, Lin Jin, Kun Yuan

  KEYWORDS: DTN; Transmission Scheduling Algorithm; Throughput; Overflow

  JOURNAL NAME: Communications and Network, Vol.5 No.3C, November 11, 2013

  ABSTRACT: Delay Tolerant Networks (DTNs) is a dynamic topology network, in which connection durations of each link are variable and paths between two nodes are intermittent. Most of protocols which are widely used in traditional wireless network are not suitable for DTNs. DTN adopts store-and-forward mechanism to cope with the problem of intermittent path. With limited storage of each node, it is a challenge for scheduling nodes’ transmission to avoid overflow of nodes’ buffers. In this paper we propose an optimal transmission scheduling algorithm for DTN with nodes’ buffer constraints. The object of the optimal algorithm is to get maximum throughput. We also present an algorithm for obtaining suboptimal transmission schedules. Our solution is certified through simulation, and it is observed that our solution can improve network performance in the aspects of avoiding overflow and increasing network throughput.