GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Position-aware ad hoc wireless networks for inter-vehicle communications: the Fleetnet project
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Geographic routing in city scenarios
ACM SIGMOBILE Mobile Computing and Communications Review
Delay-bounded routing in vehicular ad-hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Data aggregation and roadside unit placement for a vanet traffic information system
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
IrisNet: An Architecture for a Worldwide Sensor Web
IEEE Pervasive Computing
TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
IBM infosphere streams for scalable, real-time, intelligent transportation services
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Extending access point connectivity through opportunistic routing in vehicular networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
How long to wait?: predicting bus arrival time with mobile phone based participatory sensing
Proceedings of the 10th international conference on Mobile systems, applications, and services
Hi-index | 0.00 |
Efficient data delivery in vehicular networks has received increasing attention in recent years. Existing routing protocols for vehicular networks can be loosely divided into two classes: road based routing (RBR) and road oblivious routing (ROR). RBR finds a routing path along roads while ROR does not explicitly forward packets along roads. Our empirical study based on real trace-driven experiments shows that using either of an RBR algorithm or an ROR algorithm alone in a realistic vehicular network setting leads to deficiency. This results from the fact that network conditions can be different at different locations and evolving over time. Motivated by this important observation, this paper proposes an adaptive routing algorithm called RWR that adapts its routing strategy to network dynamics as the packet travels from the source to the destination. Extensive simulations based on a large dataset of real vehicular traces collected from around 2,600 taxis in Shanghai have been conducted. Comparison study shows that RWR produces higher delivery ratio than TSF and GPCR, representative routing algorithms of RBR and ROR, respectively. It achieves low delivery delay at the same time.