Timely Data Delivery in a Realistic Bus Network

Abstract : WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the problem of how to route data from its source to its destination in order to maximize the delivery probability by a given deadline. We assume to know the bus schedule, but we take into account that randomness, due to road traffic conditions or passengers boarding and alighting, affects bus mobility. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, minimizing the number of hops a packet can travel, and a recently-proposed heuristic based on bus frequencies. Our optimal algorithm outperforms all of them, but most of the times it essentially reduces to minimizing the expected traversal time. For values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to reach almost the performance of the costly flooding approach.
Type de document :
Communication dans un congrès
INFOCOM, 2011 Proceedings IEEE, Apr 2011, Shangai, China. 2011, 〈10.1109/INFCOM.2011.5935201〉
Liste complète des métadonnées

Contributeur : Giovanni Neglia <>
Soumis le : lundi 5 décembre 2011 - 12:23:17
Dernière modification le : samedi 27 janvier 2018 - 01:31:42

Lien texte intégral




Utku Acer, Paolo Giaccone, David Hay, Giovanni Neglia, Saed Tarapiah. Timely Data Delivery in a Realistic Bus Network. INFOCOM, 2011 Proceedings IEEE, Apr 2011, Shangai, China. 2011, 〈10.1109/INFCOM.2011.5935201〉. 〈hal-00648204〉



Consultations de la notice