Affiliated with RCfalse
Towards online shortest path computation
Leong Hou U1; Hong Jun Zhao1; Man Lung Yiu2; Yuhong Li1; Zhiguo Gong1
Source PublicationIEEE Transactions on Knowledge and Data Engineering

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 let the server collect live traffic information and then broadcast them over radio or wireless network. This approach has excellent scalability 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. 

KeywordAir Index Broadcasting Shortest Path
URLView the original
Indexed BySCIE
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Computer Science, Information Systems ; Engineering, Electrical & Electronic
WOS IDWOS:000333532800018
The Source to ArticleScopus
Fulltext Access
Citation statistics
Cited Times [WOS]:17   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
Affiliation1.Department of Computer and Information Science, University of Macau, Av. Padre Tomas Pereira, Taipa, Macau, China.
2.Department of Computing, Hong Kong Polytechnic University, Hong Kong
First Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Leong Hou U,Hong Jun Zhao,Man Lung Yiu,et al. Towards online shortest path computation[J]. IEEE Transactions on Knowledge and Data Engineering,2013,26(4):1012.
APA Leong Hou U,Hong Jun Zhao,Man Lung Yiu,Yuhong Li,&Zhiguo Gong.(2013).Towards online shortest path computation.IEEE Transactions on Knowledge and Data Engineering,26(4),1012.
MLA Leong Hou U,et al."Towards online shortest path computation".IEEE Transactions on Knowledge and Data Engineering 26.4(2013):1012.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Leong Hou U]'s Articles
[Hong Jun Zhao]'s Articles
[Man Lung Yiu]'s Articles
Baidu academic
Similar articles in Baidu academic
[Leong Hou U]'s Articles
[Hong Jun Zhao]'s Articles
[Man Lung Yiu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Leong Hou U]'s Articles
[Hong Jun Zhao]'s Articles
[Man Lung Yiu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.