Improvement of messages delivery time on vehicular delay-tolerant networks

• Autor(es): Soares, Vasco N. G. J. ; Rodrigues, Joel J. P. C. ; Ferreira, Paulo S. ; Nogueira, António
• Data: 2009
• Identificador Persistente: http://hdl.handle.net/10400.11/565
• Origem: Repositório Científico do Instituto Politécnico de Castelo Branco
• Assunto(s): Delay/disruption-tolerant Networks; Vehicular networks; Scheduling policies; Dropping policies
• Tipo de Documento: Artigo
• Idioma: Inglês

Descrição

“Copyright © [2009] IEEE. Reprinted from International Conference on Parallel Processing Workshops ICPPW '09.ISSN:1530-2016. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs [e-mail]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.” Vehicular Delay-Tolerant Networks (VDTNs) are an application of the Delay-Tolerant Network (DTN) concept, where the movement of vehicles and their message relaying service is used to enable network connectivity under unreliable conditions. To address the problem of intermittent connectivity, long-term message storage is combined with routing schemes that replicate messages at transfer opportunities. However, these strategies can be inefficient in terms of network resource usage. Therefore, efficient scheduling and dropping policies are necessary to improve the overall network performance. This work presents a performance analysis, based on simulation, of the impact of different scheduling and dropping policies enforced on Epidemic and Spray and Wait routing schemes. This paper evaluates these policies from the perspective of their efficiency in reducing the message’s end-to-end delay. In our scenario, it is shown that when these policies are based on the message’s lifetime criteria, the message average delay decreases significantly and the overall message delivery probability also increases for both routing protocols. Further simulations show that these results outperform the MaxProp and PRoPHET routing protocols that have their own scheduling and dropping mechanisms.