By Topic

Region-Based Location-Service-Management Protocol for VANETs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hanan Saleet ; Department of Systems Design Engineering, University of Waterloo, Waterloo, Canada ; Otman Basir ; Rami Langar ; Raouf Boutaba

The efficiency by which a node of a vehicular ad hoc network (VANET) can route messages to destinations heavily depends on the VANET's ability to keep track of the locations of its nodes (vehicles). Current location-management schemes lack scalability and, hence, are proven unable to work in large-scale networks. Therefore, location management in VANETs remains a major challenge. In this paper, we propose a new region-based location-service-management protocol (RLSMP) that uses mobility patterns as means to synthesize node movement and, thus, can be used in large VANET applications. The protocol attempts to relax the scalability issue suffered by other protocols by employing message aggregation in location updating and in querying. Furthermore, due to the protocol's intrinsic locality awareness, it achieves minimum control overhead. To evaluate the efficiency of the protocol, we study its performance analytically and by using simulation for a 2-D random-walk model, as well as on real mobility patterns. The performance of the protocol is compared with that of other prominent location-management protocols.

Published in:

IEEE Transactions on Vehicular Technology  (Volume:59 ,  Issue: 2 )