An algorithm for localization in Vehicular Ad-Hoc networks

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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 Science Publications.

Author supplied keywords

Cite

CITATION STYLE

APA

Barani, H., & Fathy, M. (2010). An algorithm for localization in Vehicular Ad-Hoc networks. Journal of Computer Science, 6(2), 168–172. https://doi.org/10.3844/jcssp.2010.168.172

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free