Scalable routing technique using road hierarchy for vehicular networks

Sandesh Uppoor, M. M. Manohara Pai, Mounir Boussedjra, Joseph Mouzna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we describe a new route discovery technique known as Scalable Routing Technique. This technique enhances the performance of the routing protocol Density Aware Routing using Road Hierarchy (DAR-RH) [3], which involves a route discovery procedure using Dijkstra algorithm before transferring data from source to destination. When DAR-RH is used in large road network scenarios the time complexity increases as Dijkstra algorithm considers all road intersections for route discovery. The solution proposed in this paper minimizes the road intersections to be considered for route discovery by dividing the city in terms of road hierarchies. By restricting Dijkstra algorithm to act on necessary data instead of entire city data shows significant performance improvement and effectiveness of our proposed technique when incorporated in DAR-RH.

Original languageEnglish
Title of host publication2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009
Pages403-407
Number of pages5
DOIs
Publication statusPublished - 01-12-2009
Event2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009 - Lille, France
Duration: 20-10-200922-10-2009

Conference

Conference2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009
CountryFrance
CityLille
Period20-10-0922-10-09

Fingerprint

road
Routing protocols
road network
performance
scenario

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Transportation

Cite this

Uppoor, S., Manohara Pai, M. M., Boussedjra, M., & Mouzna, J. (2009). Scalable routing technique using road hierarchy for vehicular networks. In 2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009 (pp. 403-407). [5399321] https://doi.org/10.1109/ITST.2009.5399321
Uppoor, Sandesh ; Manohara Pai, M. M. ; Boussedjra, Mounir ; Mouzna, Joseph. / Scalable routing technique using road hierarchy for vehicular networks. 2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009. 2009. pp. 403-407
@inproceedings{8069a9ddc7694138b1dcca23da787beb,
title = "Scalable routing technique using road hierarchy for vehicular networks",
abstract = "In this paper, we describe a new route discovery technique known as Scalable Routing Technique. This technique enhances the performance of the routing protocol Density Aware Routing using Road Hierarchy (DAR-RH) [3], which involves a route discovery procedure using Dijkstra algorithm before transferring data from source to destination. When DAR-RH is used in large road network scenarios the time complexity increases as Dijkstra algorithm considers all road intersections for route discovery. The solution proposed in this paper minimizes the road intersections to be considered for route discovery by dividing the city in terms of road hierarchies. By restricting Dijkstra algorithm to act on necessary data instead of entire city data shows significant performance improvement and effectiveness of our proposed technique when incorporated in DAR-RH.",
author = "Sandesh Uppoor and {Manohara Pai}, {M. M.} and Mounir Boussedjra and Joseph Mouzna",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/ITST.2009.5399321",
language = "English",
isbn = "9781424453467",
pages = "403--407",
booktitle = "2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009",

}

Uppoor, S, Manohara Pai, MM, Boussedjra, M & Mouzna, J 2009, Scalable routing technique using road hierarchy for vehicular networks. in 2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009., 5399321, pp. 403-407, 2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009, Lille, France, 20-10-09. https://doi.org/10.1109/ITST.2009.5399321

Scalable routing technique using road hierarchy for vehicular networks. / Uppoor, Sandesh; Manohara Pai, M. M.; Boussedjra, Mounir; Mouzna, Joseph.

2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009. 2009. p. 403-407 5399321.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Scalable routing technique using road hierarchy for vehicular networks

AU - Uppoor, Sandesh

AU - Manohara Pai, M. M.

AU - Boussedjra, Mounir

AU - Mouzna, Joseph

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In this paper, we describe a new route discovery technique known as Scalable Routing Technique. This technique enhances the performance of the routing protocol Density Aware Routing using Road Hierarchy (DAR-RH) [3], which involves a route discovery procedure using Dijkstra algorithm before transferring data from source to destination. When DAR-RH is used in large road network scenarios the time complexity increases as Dijkstra algorithm considers all road intersections for route discovery. The solution proposed in this paper minimizes the road intersections to be considered for route discovery by dividing the city in terms of road hierarchies. By restricting Dijkstra algorithm to act on necessary data instead of entire city data shows significant performance improvement and effectiveness of our proposed technique when incorporated in DAR-RH.

AB - In this paper, we describe a new route discovery technique known as Scalable Routing Technique. This technique enhances the performance of the routing protocol Density Aware Routing using Road Hierarchy (DAR-RH) [3], which involves a route discovery procedure using Dijkstra algorithm before transferring data from source to destination. When DAR-RH is used in large road network scenarios the time complexity increases as Dijkstra algorithm considers all road intersections for route discovery. The solution proposed in this paper minimizes the road intersections to be considered for route discovery by dividing the city in terms of road hierarchies. By restricting Dijkstra algorithm to act on necessary data instead of entire city data shows significant performance improvement and effectiveness of our proposed technique when incorporated in DAR-RH.

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

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

U2 - 10.1109/ITST.2009.5399321

DO - 10.1109/ITST.2009.5399321

M3 - Conference contribution

AN - SCOPUS:77950385326

SN - 9781424453467

SP - 403

EP - 407

BT - 2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009

ER -

Uppoor S, Manohara Pai MM, Boussedjra M, Mouzna J. Scalable routing technique using road hierarchy for vehicular networks. In 2009 9th International Conference on Intelligent Transport Systems Telecommunications, ITST 2009. 2009. p. 403-407. 5399321 https://doi.org/10.1109/ITST.2009.5399321