Welcome to IJSDR UGC CARE norms ugc approved journal norms IJRTI Research Journal | ISSN : 2455-2631
IJSDR
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
Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 8.15 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)

Issue: August 2022

Volume 7 | Issue 8

Impact factor: 8.15

Click Here For more Info

Imp Links for Author
Imp Links for Reviewer
Research Area
Subscribe IJSDR
Visitor Counter

Copyright Infringement Claims
Indexing Partner
Published Paper Details
Paper Title: SHORTEST PATH DETECTION IN ONLINE REPOSITTORIES
Authors Name: S SK Preethi , G.V.Ramana , J.V Krishna
Unique Id: IJSDR1610024
Published In: Volume 1 Issue 10, October-2016
Abstract: 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: 000101746
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

Click Here to Download This Article

Article Preview

Click here for Article Preview







Major Indexing from www.ijsdr.org
Google Scholar ResearcherID Thomson Reuters Mendeley : reference manager Academia.edu
arXiv.org : cornell university library Research Gate CiteSeerX DOAJ : Directory of Open Access Journals
DRJI Index Copernicus International Scribd DocStoc

Track Paper
Important Links
Conference Proposal
ISSN
DOI (A digital object identifier)


Providing A digital object identifier by DOI
How to GET DOI and Hard Copy Related
Open Access License Policy
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Creative Commons License
This material is Open Knowledge
This material is Open Data
This material is Open Content
Social Media
IJSDR

Indexing Partner