Algorithms for selecting higher wireless connection-capacity routes

Dilip Sarkar, Brandon Sato, Tutomu Murase

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

Abstract

A GPS system selects routes between two points with minimum physical distance or minimum driving time. Here we address a different type of route selection problem. Given a road map with driving distance and wireless connectivity for each road segment, find a driving route that maximizes total wireless connectivity while its length is bounded by a predetermined value. In this paper, we present three heuristic-algorithms. Initially they compute maximum connection-capacity shortest path for determining a bound for route length. The first algorithm (i) augments the road map by replacing each road segment with ratio of the distance of the road segment and its wireless communication capacity, and (ii) selects a route on the augmented map that satisfies route-length bound. The second algorithm assigns a penalty value to intersections based on their distance from a shortest path - closer the intersection, higher the penalty. The algorithm selects among unexplored intersections one that has the minimum penalty value. The final algorithm utilize the first algorithm twice for selecting a route - once to find distance and communication capacity of each intersection from the origin and then to find the same from the destination. Through extensive simulation of grid road networks it was found that on an average all three algorithms select routes that have higher communication capacity than any shortest paths. The most interesting observation is that the communication capacity gain is higher than the route length increase. For instance, when distance increase was bounded by 20%, on an average path selected by one algorithm was 11.4% longer than the length of the shortest path but connection capacity was about 32.5% higher than that of all shortest paths.

Original languageEnglish (US)
Title of host publication2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479944491, 9781479944491
DOIs
StatePublished - Jan 1 2014
Event80th IEEE Vehicular Technology Conference, VTC 2014-Fall - Vancouver, Canada
Duration: Sep 14 2014Sep 17 2014

Other

Other80th IEEE Vehicular Technology Conference, VTC 2014-Fall
CountryCanada
CityVancouver
Period9/14/149/17/14

Fingerprint

Shortest path
Intersection
Penalty
Communication
Connectivity
Road Network
Heuristic algorithms
Wireless Communication
Heuristic algorithm
Assign
Global positioning system
Maximise
Grid
Path
Simulation

Keywords

  • maximum wireless connection capacity path
  • optimal wireless connection capacity path
  • shortest path selection
  • Wireless connection capacity

ASJC Scopus subject areas

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

Cite this

Sarkar, D., Sato, B., & Murase, T. (2014). Algorithms for selecting higher wireless connection-capacity routes. In 2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings [6965862] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/VTCFall.2014.6965862

Algorithms for selecting higher wireless connection-capacity routes. / Sarkar, Dilip; Sato, Brandon; Murase, Tutomu.

2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. 6965862.

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

Sarkar, D, Sato, B & Murase, T 2014, Algorithms for selecting higher wireless connection-capacity routes. in 2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings., 6965862, Institute of Electrical and Electronics Engineers Inc., 80th IEEE Vehicular Technology Conference, VTC 2014-Fall, Vancouver, Canada, 9/14/14. https://doi.org/10.1109/VTCFall.2014.6965862
Sarkar D, Sato B, Murase T. Algorithms for selecting higher wireless connection-capacity routes. In 2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings. Institute of Electrical and Electronics Engineers Inc. 2014. 6965862 https://doi.org/10.1109/VTCFall.2014.6965862
Sarkar, Dilip ; Sato, Brandon ; Murase, Tutomu. / Algorithms for selecting higher wireless connection-capacity routes. 2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014.
@inproceedings{2bf1a3c64aeb4425b1685674bcbbc776,
title = "Algorithms for selecting higher wireless connection-capacity routes",
abstract = "A GPS system selects routes between two points with minimum physical distance or minimum driving time. Here we address a different type of route selection problem. Given a road map with driving distance and wireless connectivity for each road segment, find a driving route that maximizes total wireless connectivity while its length is bounded by a predetermined value. In this paper, we present three heuristic-algorithms. Initially they compute maximum connection-capacity shortest path for determining a bound for route length. The first algorithm (i) augments the road map by replacing each road segment with ratio of the distance of the road segment and its wireless communication capacity, and (ii) selects a route on the augmented map that satisfies route-length bound. The second algorithm assigns a penalty value to intersections based on their distance from a shortest path - closer the intersection, higher the penalty. The algorithm selects among unexplored intersections one that has the minimum penalty value. The final algorithm utilize the first algorithm twice for selecting a route - once to find distance and communication capacity of each intersection from the origin and then to find the same from the destination. Through extensive simulation of grid road networks it was found that on an average all three algorithms select routes that have higher communication capacity than any shortest paths. The most interesting observation is that the communication capacity gain is higher than the route length increase. For instance, when distance increase was bounded by 20{\%}, on an average path selected by one algorithm was 11.4{\%} longer than the length of the shortest path but connection capacity was about 32.5{\%} higher than that of all shortest paths.",
keywords = "maximum wireless connection capacity path, optimal wireless connection capacity path, shortest path selection, Wireless connection capacity",
author = "Dilip Sarkar and Brandon Sato and Tutomu Murase",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/VTCFall.2014.6965862",
language = "English (US)",
booktitle = "2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Algorithms for selecting higher wireless connection-capacity routes

AU - Sarkar, Dilip

AU - Sato, Brandon

AU - Murase, Tutomu

PY - 2014/1/1

Y1 - 2014/1/1

N2 - A GPS system selects routes between two points with minimum physical distance or minimum driving time. Here we address a different type of route selection problem. Given a road map with driving distance and wireless connectivity for each road segment, find a driving route that maximizes total wireless connectivity while its length is bounded by a predetermined value. In this paper, we present three heuristic-algorithms. Initially they compute maximum connection-capacity shortest path for determining a bound for route length. The first algorithm (i) augments the road map by replacing each road segment with ratio of the distance of the road segment and its wireless communication capacity, and (ii) selects a route on the augmented map that satisfies route-length bound. The second algorithm assigns a penalty value to intersections based on their distance from a shortest path - closer the intersection, higher the penalty. The algorithm selects among unexplored intersections one that has the minimum penalty value. The final algorithm utilize the first algorithm twice for selecting a route - once to find distance and communication capacity of each intersection from the origin and then to find the same from the destination. Through extensive simulation of grid road networks it was found that on an average all three algorithms select routes that have higher communication capacity than any shortest paths. The most interesting observation is that the communication capacity gain is higher than the route length increase. For instance, when distance increase was bounded by 20%, on an average path selected by one algorithm was 11.4% longer than the length of the shortest path but connection capacity was about 32.5% higher than that of all shortest paths.

AB - A GPS system selects routes between two points with minimum physical distance or minimum driving time. Here we address a different type of route selection problem. Given a road map with driving distance and wireless connectivity for each road segment, find a driving route that maximizes total wireless connectivity while its length is bounded by a predetermined value. In this paper, we present three heuristic-algorithms. Initially they compute maximum connection-capacity shortest path for determining a bound for route length. The first algorithm (i) augments the road map by replacing each road segment with ratio of the distance of the road segment and its wireless communication capacity, and (ii) selects a route on the augmented map that satisfies route-length bound. The second algorithm assigns a penalty value to intersections based on their distance from a shortest path - closer the intersection, higher the penalty. The algorithm selects among unexplored intersections one that has the minimum penalty value. The final algorithm utilize the first algorithm twice for selecting a route - once to find distance and communication capacity of each intersection from the origin and then to find the same from the destination. Through extensive simulation of grid road networks it was found that on an average all three algorithms select routes that have higher communication capacity than any shortest paths. The most interesting observation is that the communication capacity gain is higher than the route length increase. For instance, when distance increase was bounded by 20%, on an average path selected by one algorithm was 11.4% longer than the length of the shortest path but connection capacity was about 32.5% higher than that of all shortest paths.

KW - maximum wireless connection capacity path

KW - optimal wireless connection capacity path

KW - shortest path selection

KW - Wireless connection capacity

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

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

U2 - 10.1109/VTCFall.2014.6965862

DO - 10.1109/VTCFall.2014.6965862

M3 - Conference contribution

BT - 2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -