Delay-Minimized Routing for Full-Duplex Vehicular Ad-Hoc Networks

Full-duplex (FD) radio, which enables co-time co-channel receiving and forwarding at one device, is expected to be leveraged to improve the relay efficiency of multi-hop inter-vehicle communications. This paper considers a vehicular ad-hoc network (VANET) with some of the vehicles being FD enabled. We first present the new calculation model of the end-to-end delay, and then prove that the Dijkstra algorithm is unable to get the shortest (i.e. delay-minimized) path from source to destination. To handle this, we reformulate the network topology as an equivalent graph through decoupling all the FD-related links, and then propose an evolved-Dijkstra algorithm to find the shortest routing path of the reformulated graph with low complexity. Extensive simulations demonstrate that our approach can achieve the minimum end-to-end delay of inter-vehicle communications, and the achieved delay has a notably decline as the number of FD nodes increases.