Skip to main content
SpringerLink
Log in

Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree

  • Conference paper
Frontiers of WWW Research and Development - APWeb 2006 (APWeb 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3841))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barbara, D.: Mobile Computing and Databases - A Survey. IEEE Transactions on Knowledge and Data Engineering 11(1), 108–117 (1999)

    Article  Google Scholar 

  2. Chon, H., Agrawal, D., Abbadi, A.E.: FATES: Finding A Time dEpendent Shortest path. In: Proc. of Int. Conf. on Mobile Data Management, pp. 165–180 (2003)

    Google Scholar 

  3. Deo, N., Pang, C.Y.: Shortest path algorithms: taxonomy and annotation. Networks 14, 275–323 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research, Part B: Methodological 32(7), 499–516 (1996)

    Article  Google Scholar 

  5. Dijkstra, E.W.: A note on two problems in Connection with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  6. Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-based Dynamic Attribute Indexing Method. The Computer Journal, 185–200 (1998)

    Google Scholar 

  7. Nievergelt, J., Hinterberger, H.: The Grid File: An Adaptable, Symmetric Multikey File Structure. Proc. of ACM Trans. On Database Systems 9(1), 38–71 (1984)

    Article  Google Scholar 

  8. Brinkhoff, T.: Network-based Generator of Moving Objects, http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generastor

Download references

Author information

Authors and Affiliations

  1. Information School, Renmin University of China, 100872, Beijing, China

    Yun Bai, Yanyan Guo & Xiaofeng Meng

  2. PRISM Laboratory, Versailles University, 78000, Versailles, France

    Tao Wan & Karine Zeitouni

Authors
  1. Yun Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yanyan Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofeng Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tao Wan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Karine Zeitouni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of ITEE, The University of Queensland, Australia

    Xiaofang Zhou

  2. School of Computer Science and Technology, Heilongjiang University, China

    Jianzhong Li

  3. School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, QLD, Australia

    Heng Tao Shen

  4. Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, 153-8505, Tokyo, Japan

    Masaru Kitsuregawa

  5. Victoria University, Australia

    Yanchun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bai, Y., Guo, Y., Meng, X., Wan, T., Zeitouni, K. (2006). Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds) Frontiers of WWW Research and Development - APWeb 2006. APWeb 2006. Lecture Notes in Computer Science, vol 3841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610113_69

Download citation

  • DOI: https://doi.org/10.1007/11610113_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31142-3

  • Online ISBN: 978-3-540-32437-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation