HERO: Online Real-Time Vehicle Tracking

Intelligent transportation systems have become increasingly important for the public transportation in Shanghai. In response, ShanghaiGrid (SG) project aims to provide abundant intelligent transportation services to improve the traffic condition. A challenging service in SG is to accurately locate the positions of moving vehicles in real time. In this paper, we present an innovative scheme, hierarchical exponential region organization (HERO), to tackle this problem. In SG, the location information of individual vehicles is actively logged in local nodes which are distributed throughout the city. For each vehicle, HERO dynamically maintains an advantageous hierarchy on the overlay network of local nodes to conservatively update the location information only in nearby nodes. By bounding the maximum number of hops the query is routed, HERO guarantees to meet the real-time constraint associated with each vehicle. A small-scale prototype system implementation and extensive simulations based on the real road network and trace data of vehicle movements from Shanghai demonstrate the efficacy of HERO.

[1]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[2]  Song Jiang,et al.  LightFlood: an efficient flooding scheme for file search in unstructured peer-to-peer systems , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..

[3]  Minglu Li,et al.  HERO: Online Real-Time Vehicle Tracking in Shanghai , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[4]  Dimitrios Gunopulos,et al.  Indexing Animated Objects Using Spatiotemporal Access Methods , 2001, IEEE Trans. Knowl. Data Eng..

[5]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[6]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[7]  Christian S. Jensen,et al.  Techniques for efficient road-network-based tracking of moving objects , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  Andrew S. Tanenbaum,et al.  The Globe Distribution Network , 2000, USENIX Annual Technical Conference, FREENIX Track.

[9]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[10]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[11]  John F. Roddick,et al.  Spatial, temporal and spatio-temporal databases - hot issues and directions for phd research , 2004, SGMD.

[12]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[13]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[14]  Christian S. Jensen,et al.  Indexing the past, present, and anticipated future positions of moving objects , 2006, TODS.

[15]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[16]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Beng Chin Ooi,et al.  Efficient indexing of the historical, present, and future positions of moving objects , 2005, MDM '05.