Dead-Reckoning for Position-Based Forwarding on Highways

Position-Based Forwarding (PBF), i.e. greedy position-based packet forwarding using a beaconing-induced neighbor table, suffers from an always-outdated perception of neighbor positions, especially at low beaconing rates. However, betweenbeacon accuracy is likely to be improvable by the application of dead-reckoning strategies, the extrapolation of known position information. Especially in vehicular highway scenarios, where node movement is “very one-dimensional” and changes of direction are impossible, extrapolation seems to be useful. In this paper we study the effects of dead-reckoning strategies on the between-beacon position accuracy. To do this, we have carried out simulations to investigate the impact of different dead-reckoning strategies on protocol performance and cost and we explain the trade-offs between them. We conclude: In German highway scenarios, dead-reckoning enhanced PBF can achieve almost perfect packet delivery with beacon intervals of up to 6 seconds, whereas standard PBF loses a significant ratio of packets even at a beacon interval of 1 second. In general, we show results indicating that the application of dead-reckoning generates (a) less beaconing traffic with an equal or better perception of the neighbors’ positions and (b) less overall transmission cost caused by frequent packet retransmissions when using the same beaconing frequencies.

[1]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[2]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[3]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[4]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[5]  Martin Mauve,et al.  A Reactive Location Service for Mobile Ad Hoc Networks , 2002 .

[6]  Martin Mauve,et al.  Location-Based Routing for Vehicular Ad-Hoc Networks , 2002 .

[7]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[8]  Martin Mauve,et al.  Simulation Results and a Proof-of-Concept Implementation of the FleetNet Position-Based Router: Extended Abstract , 2003, PWC.

[9]  Martin Mauve,et al.  A comparison of routing strategies for vehicular ad-hoc networks , 2002, MobiCom 2002.

[10]  Lixin Gao,et al.  Prediction-Based Routing for Vehicular Ad Hoc Networks , 2007, IEEE Transactions on Vehicular Technology.

[11]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[12]  Holger Füßler,et al.  Effects of a realistic channel model on packet forwarding in vehicular ad hoc networks , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[13]  Holger Füßler,et al.  Studying vehicle movements on highways and their impact on ad-hoc connectivity , 2006, MOCO.

[14]  H. Hartenstein,et al.  Contention-based forwarding for street scenarios , 2004 .