Abstract

Many geographic routing algorithms have been proposed for vehicular ad hoc networks (VANETs), which have the strength of not maintaining any routing structures. However, most of which rely on the availability of accurate real-time location information. It is well known that vehicles can be intermittently connected with other vehicles. Thus, in such networks, it is difficult or may incur considerable cost to retrieve accurate locations of moving vehicles. Furthermore, the location information of a moving vehicle available to other vehicles is usually time-lagged since it is constantly moving over time. Fortunately, we observe that the short-term future locations of vehicles can be predicted. Based on the important observation, we propose a novel approach for geographic routing which exploits the predictive locations of vehicles. Thus, we have developed a prediction technique based on the current speed and heading direction of a vehicle. As a result, the request frequency of location updates can be reduced. In addition, we propose two forwarding strategies and three buffer management strategies. We have performed extensive simulations based on real vehicular GPS traces collected from around 4,000 taxis in Shanghai, China. Simulation results clearly show that geographic routing based on predictive locations is viable and can significantly reduce the cost of location updates.

Highlights

  • The combination of vehicles and wireless communication has created a promising technology of vehicular ad hoc networks (VANETs) [1]

  • 4 Evaluation We compare the performance of the proposed geographic routing based on predictive locations (GRPL) with Greedy Perimeter Stateless Routing (GPSR) [8] which always queries for the most update location of every target vehicle and incurs a high cost of location update

  • 4.2 Impact of location update frequency We study the performance of GPSR and our GRPL routing with different packet selection strategies under different location update period

Read more

Summary

Introduction

The combination of vehicles and wireless communication has created a promising technology of vehicular ad hoc networks (VANETs) [1]. The vehicles are distributed with different densities These characteristics together suggest that most existing designs and solutions for traditional network systems, Efficient routing is essential to VANETs, which determines how a data packet can be delivered from a vehicle to another. Many geographic routing algorithms have been proposed, which share the central idea that a packet destined to a remote vehicle is always forwarded towards the direction of the destination. Most of existing geographic routing algorithms, take it for granted that the location information of the destination vehicle is accessed in real time. Such assumption is impractical in the real world considering the cost may be incurred

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call