Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles

I. Te Lin, Dilip Sarkar, Tutomu Murase, Iwao Sasase

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

2 Citations (Scopus)

Abstract

In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wireless services (base station and access points etc.) along the route. To the best of our knowledge, currently no algorithm exists for selecting a route that maximizes wireless connection-capacity, while keeping route length shortest and close to shortest. In this paper, we propose two modified version of Dijkstra route selection algorithms: one for selecting a maximum connection capacity shortest route, and the other is for discovering higher wireless connection-capacity routes; the length of the route could be larger than a shortest route, but no larger than predetermined bound. The second proposed algorithm exploits the state change of the intersection to broaden the search range of possible routes. Results from our extensive simulation for a Manhattan-street type grid network with the heterogeneous IEEE 802.11a wireless access, show that for a 50% increase in route length and 15 Access Points (APs), the proposed algorithm can increases wireless connection-capacity by 35.67% and 31.27% compared to the shortest and random route selection algorithms, respectively.

Original languageEnglish (US)
Title of host publicationIEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings
DOIs
StatePublished - Aug 20 2012
EventIEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Yokohama, Japan
Duration: May 6 2012Jun 9 2012

Other

OtherIEEE 75th Vehicular Technology Conference, VTC Spring 2012
CountryJapan
CityYokohama
Period5/6/126/9/12

Fingerprint

Automobile
Automobiles
Base stations
Availability
Intersection
Maximise
Grid
Range of data
Simulation

Keywords

  • Dijkstra's algorithm
  • higher wireless connection-capacity
  • shortest route
  • tolerable length increase

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Lin, I. T., Sarkar, D., Murase, T., & Sasase, I. (2012). Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles. In IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings [6239958] https://doi.org/10.1109/VETECS.2012.6239958

Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles. / Lin, I. Te; Sarkar, Dilip; Murase, Tutomu; Sasase, Iwao.

IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings. 2012. 6239958.

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

Lin, IT, Sarkar, D, Murase, T & Sasase, I 2012, Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles. in IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings., 6239958, IEEE 75th Vehicular Technology Conference, VTC Spring 2012, Yokohama, Japan, 5/6/12. https://doi.org/10.1109/VETECS.2012.6239958
Lin IT, Sarkar D, Murase T, Sasase I. Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles. In IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings. 2012. 6239958 https://doi.org/10.1109/VETECS.2012.6239958
Lin, I. Te ; Sarkar, Dilip ; Murase, Tutomu ; Sasase, Iwao. / Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles. IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings. 2012.
@inproceedings{e656f09dd60c4f5f8fb63dfe49891108,
title = "Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles",
abstract = "In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wireless services (base station and access points etc.) along the route. To the best of our knowledge, currently no algorithm exists for selecting a route that maximizes wireless connection-capacity, while keeping route length shortest and close to shortest. In this paper, we propose two modified version of Dijkstra route selection algorithms: one for selecting a maximum connection capacity shortest route, and the other is for discovering higher wireless connection-capacity routes; the length of the route could be larger than a shortest route, but no larger than predetermined bound. The second proposed algorithm exploits the state change of the intersection to broaden the search range of possible routes. Results from our extensive simulation for a Manhattan-street type grid network with the heterogeneous IEEE 802.11a wireless access, show that for a 50{\%} increase in route length and 15 Access Points (APs), the proposed algorithm can increases wireless connection-capacity by 35.67{\%} and 31.27{\%} compared to the shortest and random route selection algorithms, respectively.",
keywords = "Dijkstra's algorithm, higher wireless connection-capacity, shortest route, tolerable length increase",
author = "Lin, {I. Te} and Dilip Sarkar and Tutomu Murase and Iwao Sasase",
year = "2012",
month = "8",
day = "20",
doi = "10.1109/VETECS.2012.6239958",
language = "English (US)",
isbn = "9781467309905",
booktitle = "IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings",

}

TY - GEN

T1 - Dijkstra-based higher capacity route selection algorithm using bounded length and state change for automobiles

AU - Lin, I. Te

AU - Sarkar, Dilip

AU - Murase, Tutomu

AU - Sasase, Iwao

PY - 2012/8/20

Y1 - 2012/8/20

N2 - In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wireless services (base station and access points etc.) along the route. To the best of our knowledge, currently no algorithm exists for selecting a route that maximizes wireless connection-capacity, while keeping route length shortest and close to shortest. In this paper, we propose two modified version of Dijkstra route selection algorithms: one for selecting a maximum connection capacity shortest route, and the other is for discovering higher wireless connection-capacity routes; the length of the route could be larger than a shortest route, but no larger than predetermined bound. The second proposed algorithm exploits the state change of the intersection to broaden the search range of possible routes. Results from our extensive simulation for a Manhattan-street type grid network with the heterogeneous IEEE 802.11a wireless access, show that for a 50% increase in route length and 15 Access Points (APs), the proposed algorithm can increases wireless connection-capacity by 35.67% and 31.27% compared to the shortest and random route selection algorithms, respectively.

AB - In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wireless services (base station and access points etc.) along the route. To the best of our knowledge, currently no algorithm exists for selecting a route that maximizes wireless connection-capacity, while keeping route length shortest and close to shortest. In this paper, we propose two modified version of Dijkstra route selection algorithms: one for selecting a maximum connection capacity shortest route, and the other is for discovering higher wireless connection-capacity routes; the length of the route could be larger than a shortest route, but no larger than predetermined bound. The second proposed algorithm exploits the state change of the intersection to broaden the search range of possible routes. Results from our extensive simulation for a Manhattan-street type grid network with the heterogeneous IEEE 802.11a wireless access, show that for a 50% increase in route length and 15 Access Points (APs), the proposed algorithm can increases wireless connection-capacity by 35.67% and 31.27% compared to the shortest and random route selection algorithms, respectively.

KW - Dijkstra's algorithm

KW - higher wireless connection-capacity

KW - shortest route

KW - tolerable length increase

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

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

U2 - 10.1109/VETECS.2012.6239958

DO - 10.1109/VETECS.2012.6239958

M3 - Conference contribution

AN - SCOPUS:84864982915

SN - 9781467309905

BT - IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings

ER -