A routing protocol using relative velocity in inter vehicle communication

Min Woo Ryu; Si Ho Cha; Keun Wang Lee; Seokjoong Kang; Kuk Hyun Cho

A routing protocol using relative velocity in inter vehicle communication

Min Woo Ryu, Si Ho Cha, Keun Wang Lee, Seokjoong Kang, Kuk Hyun Cho

Graduate School of management of technology

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

VANET (Vehicular Ad-hoc Network) have unique characteristics, including high node mobility and rapidly changing network topology which differentiates it from MANET. Despite the many studies that are currently under way, local maximum problem in greedy forwarding and link breakage due to change in node speed have yet to be solved. Therefore, this paper proposes RWR (Relative Vehicle Velocity Routing) algorithm which to solve these problems. The proposed RWR algorithm solves the local maximum and the link breakage problems by taking into account the density and the speed of neighbor nodes. Simulation results using ns-2 revealed that the proposed RWR algorithm performs better than the existing routing protocols based on greedy forwarding.

Original language	English
Pages (from-to)	1893-1898
Number of pages	6
Journal	Information (Japan)
Volume	17
Issue number	5
Publication status	Published - 2014 Jan 1

ASJC Scopus subject areas

General

Cite this

@article{66567bb216bb4f4bb6a8628933880ce8,

title = "A routing protocol using relative velocity in inter vehicle communication",

abstract = "VANET (Vehicular Ad-hoc Network) have unique characteristics, including high node mobility and rapidly changing network topology which differentiates it from MANET. Despite the many studies that are currently under way, local maximum problem in greedy forwarding and link breakage due to change in node speed have yet to be solved. Therefore, this paper proposes RWR (Relative Vehicle Velocity Routing) algorithm which to solve these problems. The proposed RWR algorithm solves the local maximum and the link breakage problems by taking into account the density and the speed of neighbor nodes. Simulation results using ns-2 revealed that the proposed RWR algorithm performs better than the existing routing protocols based on greedy forwarding.",

keywords = "Greedy Forwarding, Mobility, Relative Velocity, V2V, VANET",

author = "Ryu, {Min Woo} and Cha, {Si Ho} and Lee, {Keun Wang} and Seokjoong Kang and Cho, {Kuk Hyun}",

year = "2014",

month = jan,

day = "1",

language = "English",

volume = "17",

pages = "1893--1898",

journal = "Information (Japan)",

issn = "1343-4500",

publisher = "International Information Institute",

number = "5",

}

TY - JOUR

T1 - A routing protocol using relative velocity in inter vehicle communication

AU - Ryu, Min Woo

AU - Cha, Si Ho

AU - Lee, Keun Wang

AU - Kang, Seokjoong

AU - Cho, Kuk Hyun

PY - 2014/1/1

Y1 - 2014/1/1

N2 - VANET (Vehicular Ad-hoc Network) have unique characteristics, including high node mobility and rapidly changing network topology which differentiates it from MANET. Despite the many studies that are currently under way, local maximum problem in greedy forwarding and link breakage due to change in node speed have yet to be solved. Therefore, this paper proposes RWR (Relative Vehicle Velocity Routing) algorithm which to solve these problems. The proposed RWR algorithm solves the local maximum and the link breakage problems by taking into account the density and the speed of neighbor nodes. Simulation results using ns-2 revealed that the proposed RWR algorithm performs better than the existing routing protocols based on greedy forwarding.

AB - VANET (Vehicular Ad-hoc Network) have unique characteristics, including high node mobility and rapidly changing network topology which differentiates it from MANET. Despite the many studies that are currently under way, local maximum problem in greedy forwarding and link breakage due to change in node speed have yet to be solved. Therefore, this paper proposes RWR (Relative Vehicle Velocity Routing) algorithm which to solve these problems. The proposed RWR algorithm solves the local maximum and the link breakage problems by taking into account the density and the speed of neighbor nodes. Simulation results using ns-2 revealed that the proposed RWR algorithm performs better than the existing routing protocols based on greedy forwarding.

KW - Greedy Forwarding

KW - Mobility

KW - Relative Velocity

KW - V2V

KW - VANET

UR - http://www.scopus.com/inward/record.url?scp=84903975831&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84903975831&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84903975831

SN - 1343-4500

VL - 17

SP - 1893

EP - 1898

JO - Information (Japan)

JF - Information (Japan)

IS - 5

ER -

A routing protocol using relative velocity in inter vehicle communication

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this