Dijkstra-Based Higher Capacity Route Selection Algorithm Using Bounded Length and State Change for Automobiles

@article{Lin2012DijkstraBasedHC,
  title={Dijkstra-Based Higher Capacity Route Selection Algorithm Using Bounded Length and State Change for Automobiles},
  author={I-Te Lin and Dilip Sarkar and Tutomu Murase and Iwao Sasase},
  journal={2012 IEEE 75th Vehicular Technology Conference (VTC Spring)},
  year={2012},
  pages={1-5}
}
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… CONTINUE READING
3 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Optimal longcut route selection for wireless mobile users (in Japanese)

  • Y. Sudo, G. Motoyoshi, T. Murase, T. Masuzawa
  • IEICE Technical Report, RCS2009269, 2010.
  • 2009
1 Excerpt

Quality of service routing for supporting multimedia applications

  • M. Tarique, K. E. tepe, +7 authors J. Crowcroft
  • IEEE Journal of Selected Areas in Communications…
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…