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
Country/TerritoryFrance
CityLille
Period20-10-0922-10-09

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'Scalable routing technique using road hierarchy for vehicular networks'. Together they form a unique fingerprint.

Cite this