Content Distribution Optimization Algorithms in Vehicular Networks

Abstract

Content distribution strategies for delayed-tolerance networks (DTNs), such as Local Rarest Bundle First (LRBF), reach high delivery rate in the vehicular ad-hoc networks (VANETs), in spite of their continuous node mobility and their wide geographical dispersion. However, to reach a high delivery rate, this strategy requires each node to periodically send control packets with information of which content bundles it contains and that are available to its neighbours, increasing the network overhead. To overcome this problem, we are proposing two content distribution approaches to minimize the size of the control packets. Our results show that our algorithms can reduce more than 90% the size of control packets, while decreasing the network overhead without changing the delivery rate and endto-end delay.