Efficient multiple-copy routing in software-defined vehicular networks

Abstract

Multiple-copy routing is widely used in sparse vehicular ad hoc networks (VANETs). Recently, we proposed a novel architecture named software-defined vehicular networks (SDVNs) that can provide a global view of the whole network and centralized control over vehicular switches. However, existing multiple-copy routing protocols cannot utilize the benefits of SDVNs to improve routing efficiency. In this paper, we propose a Spray-and-Prey multiple-copy routing protocol for SDVNs. The Spray-and-Prey protocol uses graph-based minimum communication hops to define the utility of carriers and utilize two copies cooperation schemes to reduce delivery delay. Further more, the proposed protocol can clear other copies in the network when one copy arrives at the destination with low cost. Simulation experiment demonstrates that spray-and-prey protocol has lower delivery delay and network resource cost than other protocol in sparse SDVNs scenarios.