Scheduling and drop policies for traffic differentiation on vehicular delay-tolerant networks

Authors:
Vasco N. G. J. Soares;Farid Farahmand;Joel J. P. C. Rodrigues
Affiliations:
Instituto de Telecomunicações, Covilhã, Portugal and Dept. of Informatics, Univ. of Beira Interior, Covilhã, Portugal and Superior School of Tech., Polytechnic Inst. of Castelo ...;Department of Engineering Science, Sonoma State University, CA;Instituto de Telecomunicações, Covilhã, Portugal and Department of Informatics, University of Beira Interior, Covilhã, Portugal
Venue:
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Year:
2009

Citing 5
Cited 1

Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Relays, base stations, and meshes: enhancing mobile networks with infrastructure

Proceedings of the 14th ACM international conference on Mobile computing and networking
The ONE simulator for DTN protocol evaluation

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Improving vehicular delay-tolerant network performance with relay nodes

NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks

ICPPW '09 Proceedings of the 2009 International Conference on Parallel Processing Workshops

Traffic management strategy for delay-tolerant networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vehicular Delay-Tolerant Networks (VDTNs) are a promising technology for vehicular communications, creating application scenarios that enable non-real time services with diverse performance requirements. Because of scarce network resources (e.g. bandwidth and storage capacity) and node's short contact durations, the underlying VDTN network infrastructure must be capable of prioritizing traffic. This paper investigates several scheduling and drop policies, which can be used to implement traffic differentiation. Priority Greedy, Round Robin, and Time Threshold scheduling polices are proposed. In terms of drop policy, the message with the lowest priority and the lowest remaining time-to-live is discarded first. We evaluate their efficiency and tradeoffs, through simulation. The results presented in this paper can be used as a starting point for further studies in this research field, and give helpful guidelines for future VDTN protocol design.