Author(s)

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

Department of Automation2, University of Science and Technology of China, Hefei, Anhui, China.
State Key Laboratory of Integrated Service Networks1,Xidian University, Xi’an, China.

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.

DTN; Transmission Scheduling Algorithm; Throughput; Overflow

Yu, W. , Li, H. , Li, J. , Jin, L. and Yuan, K. (2013) Transmission Scheduling Algorithm in DTN. Communications and Network, 5, 255-259. doi: 10.4236/cn.2013.53B2047.