Efficient dynamic traffic navigation with hierarchical aggregation tree

Authors:
Yun Bai;Yanyan Guo;Xiaofeng Meng;Tao Wan;Karine Zeitouni
Affiliations:
Information School, Renmin University of China, Beijing, China;Information School, Renmin University of China, Beijing, China;Information School, Renmin University of China, Beijing, China;PRISM Laboratory, Versailles University, Versailles, France;PRISM Laboratory, Versailles University, Versailles, France
Venue:
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Year:
2006

Citing 3
Cited 1

The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
Mobile Computing and Databases-A Survey

IEEE Transactions on Knowledge and Data Engineering
FATES: Finding A Time dEpendent Shortest path

MDM '03 Proceedings of the 4th International Conference on Mobile Data Management

Adaptive navigation of vehicles in congested road networks

Proceedings of the 5th international conference on Pervasive services

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a challenge due to the highly variable traffic state and the requirement of fast, on-line computations. This motivates us to design an intelligent city traffic control system, which is based on an extension of the Quad-tree access method that adapts better to the road networks while it maintains aggregated information on traffic density according to hierarchy levels. Based on this index, a view-based hierarchy search method is proposed to accelerate the optimal path computation. At the end, the experiment will show this index structure to be effective and efficient.