INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016
open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15
The online shortest path problem aims at computing the shortest path based on live traffic circumstances. This is very important in modern car navigation systems as it helps drivers to make sensible decisions. To our best knowledge, there is no efficient system/solution that can offer affordable costs at both client and server sides for online shortest path computation.Unfortunately, the conventional client-server architecture scales poorly with the number of clients. A promising approach is to letthe server collect live traffic information and then broadcast them over radio or wireless network. This approach has excellentscalability with the number of clients. Thus, we develop a new framework called live traffic index (LTI) which enables drivers to quickly and effectively collect the live traffic information on the broadcasting channel. An impressive result is that the driver can compute/update their shortest path result by receiving only a small fraction of the index. Our experimental study shows that LTI is robust to various parameters and it offers relatively short tune-in cost (at client side), fast query response time (at client side),small broadcast size (at server side), and light maintenance time (at server side) for online shortest path problem.
Keywords:
Spatial databases; Vehicle driving; Broadcasting
Cite Article:
"SHORTEST PATH DETECTION IN ONLINE REPOSITTORIES", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.1, Issue 10, page no.135 - 138, October-2016, Available :http://www.ijsdr.org/papers/IJSDR1610024.pdf
Downloads:
000337351
Publication Details:
Published Paper ID: IJSDR1610024
Registration ID:160881
Published In: Volume 1 Issue 10, October-2016
DOI (Digital Object Identifier):
Page No: 135 - 138
Publisher: IJSDR | www.ijsdr.org
ISSN Number: 2455-2631
Facebook Twitter Instagram LinkedIn