K-transmissions epidemic routing algorithm in large-scale bus-based DTNs

The bus-based DTNs we study in this paper are special cases of DTNs, in which many routing protocol have been proposed in the literature, such as epidemic routing. This paper studies the packet spreading in a realistic bus scenario. We firstly find that more than two buses meet at the same time by investigating a real-life traces collected in Chicago. In other words, there is more than one bus within the communication range of a bus at one moment. Thus we propose a k-transmissions epidemic routing algorithm. The algorithm could tradeoff the number of copies and the average delivery delay by adjusting the value of k. Lastly, the simulation compares the two cases of k-transmissions epidemic routing algorithm when k=1 and ∞.