By Topic

Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Soares, V.N.G.J. ; Inst. de Telecomun., Univ. of Beira Interior, Castelo Branco, Portugal ; Rodrigues, J.J.P.C. ; Ferreira, P.S. ; Nogueira, A.M.D.

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.

Published in:

Parallel Processing Workshops, 2009. ICPPW '09. International Conference on

Date of Conference:

22-25 Sept. 2009