Collection of Effective Live traffic Information on Broadcasting Channel

M vamsi Krishna, S Madhuri, M Naga Babu

Abstract


Several online services provide live traffic data by analyzing collected data from road sensors, traffic cameras, and crowd sourcing techniques such as Google- Map, Navteq, INRIX Traffic Information Provider, and TomTom NV, etc. These systems can work out the photograph shortest path queries based on current live traffic data. But they do not account routes to drivers incessantly due to high operating costs. Answering the shortest paths on the live traffic data can be vision as a continuous monitoring problem in spatial databases which is termed online shortest paths computation (OSP) in this work. This function helps a driver to figure out the best route from his current position to destination. Naturally, the shortest path is work out by offline data pre-stored in the navigation systems and the weight travel time of the road edges is rough and ready by the road distance or historical data.


Keywords


Shortest path, air index, broadcasting

References


H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes, “In Transit to Constant Time Shortest-Path Queries in Road Networks,” Proc. Workshop Algorithm Eng. and Experiments (ALENEX), 2007.

P. Sanders and D. Schultes, “Engineering Highway Hierarchies,” Proc. 14th Conf. Ann. European Symp. (ESA), pp. 804-816, 2006.

G. Dantzig, Linear Programming and Extensions, series Rand Corporation Research Study Princeton Univ. Press, 1963.

R.J. Gutman, “Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks,” Proc. Sixth Workshop Algorithm Eng. and Experiments and the First Workshop

Analytic Algorithmic and Combinatorics (ALENEX/ANALC), pp. 100-111, 2004.

B. Jiang, “I/O-Efficiency of Shortest Path Algorithms: An Analysis,” Proc. Eight Int’l Conf. Data Eng. (ICDE), pp. 12-19, 1992.

P. Sanders and D. Schultes, “Highway Hierarchies Hasten Exact Shortest Path Queries,” Proc. 13th Ann. European Conf. Algorithms (ESA), pp. 568-579, 2005.

D. Schultes and P. Sanders, “Dynamic Highway-Node Routing,” Proc. Sixth Int’l Conf. Experimental Algorithms (WEA), pp. 66-79, 2007.

F. Zhan and C. Noon, “Shortest Path Algorithms: An Evaluation Using Real Road Networks,” Transportation Science, vol. 32, no. 1, pp. 65-73, 1998.

“Google Maps,” http://maps.google.com, 2014.

“NAVTEQ Maps and Traffic,” http://www.navteq.com, 2014.

“INRIX Inc. Traffic Information Provider,” http://www.inrix. com, 2014.

“TomTom NV,” http://www.tomtom.com, 2014.

“Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2010-2015,” 2011.

D. Stewart, “Economics of Wireless Means Data Prices Bound to Rise,” The Global and Mail, 2011.

W.-S. Ku, R. Zimmermann, and H. Wang, “Location-Based Spatial Query Processing in Wireless Broadcast Environments,” IEEE Trans. Mobile Computing, vol. 7, no. 6, pp. 778-791, June 2008.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.