An Algorithm for Localization in Vehicular Ad-Hoc Networks
Hajar Barani and Mahmoud Fathy
DOI : 10.3844/jcssp.2010.168.172
Journal of Computer Science
Volume 6, Issue 2
Positioning a node in Vehicular Ad-Hoc networks is one of the most interested research areas in recent years. In many Ad-Hoc networks such as Vehicular Ad-Hoc networks in which the nodes are considered as vehicles, move very fast in streets and highways. So, to have a safe and fast transport system, any vehicle should know where a traffic problem such as a broken vehicle occurs. GPS is one of the equipments which have been widely used for positioning service. Problem statement: Vehicle can use a GPS receiver to determine its position. But, all vehicles have not been equipped with GPS or they cannot receive GPS signals in some places such as inside of a tunnel. In these situations, the vehicle should use a GPS free method to find its location. Approach: In this study, a new method based on transmission range had been suggested. Results: This algorithm had been compared with a similar algorithm ODAM in same situations. The best performance for Optimized Disseminating Alarm Message (ODAM) is when 40% of nodes are equipped with GPS. Conclusion: We executed our algorithm on this situation and compared it with ODAM results. At the end of this study, we can see our algorithm in compare to ODAM has better results.
© 2010 Hajar Barani and Mahmoud Fathy. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.