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
Role-based multicast in highly mobile but sparsely connected ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Modern Wireless Communication
MDDV: a mobility-centric data dissemination algorithm for vehicular networks
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Geographic routing in city scenarios
ACM SIGMOBILE Mobile Computing and Communications Review
Data aggregation and roadside unit placement for a vanet traffic information system
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
A distributed approach for location lookup in vehicular ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Vehicle Ad Hoc networks: applications and related technical issues
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
As progress in VANETs research continues, there is a persuasive need to support Quality of Service (QoS) routing in such networks. While greedy forwarding is used in many MANETs applications, it is found that it is not convenient for VANETs applications. In this paper, we investigate the important and difficult challenge of QoS routing in VANETs. First, we present an adaptive message routing protocol that uses up to date information about the local topology in order to find the route with minimum end-to-end delay while maintaining a threshold for the connectivity probability and hop count. Then, we propose a genetic algorithm to solve this. To do so, we formulate the QoS routing as a constrained optimization problem. We also derive analytical expressions for the delay as well as the connectivity probability of a route in a two-way street scenario. Numerical and simulation results show that our algorithm gives an optimal or near optimal solutions, which provides an interactive and effective design environment and enriches our protocol performance compared to GPCR.