Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Time-reference distribution in delay tolerant networks
Proceedings of the seventh ACM international workshop on Challenged networks
An analysis of evaluation practices for DTN routing protocols
Proceedings of the seventh ACM international workshop on Challenged networks
| Hi-index | 0.00 |
Communication is crucial to the coordination and efficient operation of public transport systems. However, deployment of infrastructure based communication systems is very expensive. Delay tolerant vehicular networks are a promising alternative since only very few infrastructure elements are required. This paper presents a DTN routing algorithm for urban public transport systems. Beginning with an analysis of node mobility, system characteristics are derived and exploited to improve routing performance. To increase realism in the performance evaluation and comparison a new approach is taken for the generation of mobility traces. A map based on real cartographic data is combined with line definitions, stops and timetables of real public transport systems. A micromobility simulator then produces large scale mobility traces which are fed into a DTN simulator. We compare various DTN routing schemes with our algorithm. Moreover, the impact of disturbances in the public transport system on the routing performance is examined. The results show that our routing algorithm can outperform previously proposed algorithms even if 20% of all vehicles are behind schedule.