Transmission Scheduling Algorithm in DTN

DOI: 10.4236/cn.2013.53B2047   PDF   HTML     3,630 Downloads   4,735 Views   Citations

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.

Share and Cite:

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.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] K. Fall, “A Delay Tolerant Network Architecture for Challenged Internets,” in Proceedings of ACM SIGCOM pp. 27-24, 2003.
[2] S. Merugu, M. Ammar and E. Zegura, “Routing in Space and Time in Networks with Predictable Mobility,” Georgia Institute of Technology, Tech. Rep., 2004.
[3] J. Francois and G. Leduc, “Routing Based on Delivery Distributions in Predictable Disruption Tolerant Networks,” Ad-Hoc Networks, Vol. 7, No. 1, 2009, pp. 219-229. doi:10.1016/j.adhoc.2008.02.006
[4] M. Huang, S. Chen, Y. Zhu, et al., “Topology Control for Time-evolving and Predictable Delay-tolerant Networks,” in IEEE MASS, 2011.
[5] S. Jain, K. R. Fall and R. K. Patra, “Routing in a Delay Tolerant Network,” in ACM SIGCOMM, 2004, pp. 145-158.
[6] D. Hay and P. Giaccone, “Optimal Routing and Scheduling for Deterministic Delay Tolerant Networks[C]” Wireless On- Demand Network Systems and Services, 2009. WONS 2009. Sixth International Conference on. IEEE, 2009, pp. 27-34.
[7] 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.
[8] V. N. G. J. Soares, J. J. P. C. Rodrigues, P. S. Ferreira and A. M. D. Nogueira, “Improvement of Messages Delivery time on Vehicular Delay-tolerant Networks,” in International Conference on Parallel Processing Workshops (pp. 344-349). IEEE. 2009.
[9] S. Rashid, Q. Ayub, “Effective Buffer Man-agement Policy DLA for DTN Routing Protocals under Congestion,” International Journal of Computer and Network Security, Vol. 2, No. 9, 2010. pp. 118-121.
[10] S. Rashid, et al.,“E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols,” International Journal, 2011, Vol. 13, No. 7, pp. 8-13.

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.