A transmission scheduling method of cooperative downloading for Vehicular Networking

Cooperative downloading is an important measure for increasing the amount of data downloaded to the users of Vehicular Networking (VANET). However, data exchange causes frequent collision among cooperative vehicles and the client. To solve the problem, in this paper, we propose a transmission scheduling method. Firstly, the method builds a k-constraint routing tree according to the amount of linked route, and then schedules the time to transmit for every node in the tree. The goal of the method is to forward data as soon as possible on the premise of collision free. Simulation results indicate the benefits of the proposed scheme in terms of increasing efficiency and reducing delay.