On the application of dead-reckoning to position-based routing for vehicular highway scenarios

Position-based routing suffers from inaccurate neighbor positions, especially at low beaconing rates. In this paper we propose to add dead-reckoning to the forwarder selection process to predict the positions of neighboring nodes. We have carried out simulations to investigate the consequences of this modification and explain the trade-offs. With the modified algorithm, we achieve a complete packet delivery for beaconing intervals of as much as 6 seconds for a medium-density German highway setting. We will show that the dead-reckoning scheme results in (a) less beacon traffic with equal or better neighbor position prediction and (b) less overhead induced by transmit failures when using the same beaconing frequencies.