Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Call For Paper : Vol. 9, Issue 6 , 2022
Greedy hop algorithm for detecting shortest path in Vehicular Networks

Author : Gayathri. S 1 Dr.N.Radhika 2

Date of Publication :7th March 2016

Abstract: VANET (Vehicular Adhoc Networks) is an upcoming research area due to the development in reducing traffic congestion. It has various challenges to adopt on the design of protocols that can serve in different topologies and scenarios. The main motive of VANET (Vehicular Adhoc Networks) is to build a robust network among vehicles so that the vehicles can communicate with each other for the safety of human beings. In case of accidents, the vehicles on the other end should receive the warning message in short time so that they can decide and make a proper decision for diversion. In this paper, we design the network in such a way that the warning messages are sent in shortest path using Greedy-hop algorithm. This will help the vehicles in the environment to be free from congestion. Hence, we evaluate our work with performance metrics like throughput, delay and packet delivery ratio.

Reference :

    1. Marwaaltayeb and imadmahgoub “a survey of vehicular ad hoc networks routing protocols” international journal of innovation and applied studies, vol. 3 no. 3, pp. 829- 846, july 2013.
    2. Www. Enkelmann, "fleet net-applications for intervehicle communication," in intelligent vehicles symposium, 2003 proceeding ieee, 2003, pp. 162- 167.
    3. J.a. Guerrero-ibáñez, c. Flores-cortés, and sherali zeadally, “vehicular ad-hoc networks (vanets): architecture, protocols and applications”, computer communications and networks © springer-verlag london 2013
    4. H. Moustafa and y. Zhang, ’vehicular networks: techniques, standards, and applications’, 2009
    5. Raya, maxim and jean-pierre hubaux, ’securing vehicular ad hoc networks’, journal of computer security, pp.39-68, 2007
    6. . M. . uentes, a. I. onz lez tablas, and a. Ribagorda, ‘overview of security issues in vehicular adhoc networks’, in handbook of research on mobility and
    7. computing: evolving technologies and ubiquitous impacts, igi global, pp. 894-911, 2011.
    8. Yanmin zhu1, chao chen1 and min gao “an evaluation of vehicular networks with real vehicular gps traces ”eurasip journal on wireless communications and networking 2013,pp.190, 13 july 2013
    9. Selvasuganya r., visu p. “bidirectional search algorithm for finding shortest path routing in vehicular ad-hoc network vanets)” in www.academia.edu
    10. Huma ghafoor, insoo koo and nasir-ud-din gohar “neighboring and connectivity-aware routing in vanets” in science world journal, may 2014
    11. Amit r. Welekar, prashant borkar “adoption of shortest path algorithm (dijkstra's) in distributed vanet using grid computing” in icict-2011, bangalore
    12. Pardakhe n.v , dandge s.s “detecting shortest path using vehicular routing protocol” in international journal of advanced research in computer and communication engineering vol. 4, issue 9, september 2015
    13. Smitha shekar b , narendra kumar g, usha rani h v, divyashree c k , gayatri george and aparajitha murali “gps based shortest path for ambulances using vanets” in international conference on wireless networks (icwn 2012), vol. 49, iacsit press, singapore.
    14. inju annie george, shyjith m.b “reliable and efficient data transfer with minimum drop and recovery mechanism using lcm in wireless sensor network” international journal of advanced research in computer science and electronics engineering (ijarcsee) volume 3, issue 3, march 2014.

Recent Article