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 ot...

• Type: Journal
• Year: 2011
• Where: INFOCOM
• Authors: Utku Acer, Paolo Giaccone, David Hay, Giovanni Neglia, Saed Tarapiah
• Keywords: Bus Mobility, Communications, INFOCOM 2011, Routing Algorithm, Traversal Time