Randomization in traffic information sharing systems

  • Authors:
  • Masaaki Tanizaki;Ouri Wolfson

  • Affiliations:
  • Central Research Laboratory, Kokubunji-shi, Tokyo, Japan and University of Illinois at Chicago, Chicago, IL;University of Illinois at Chicago, Chicago, IL

  • Venue:
  • Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider a traffic information sharing system based on Floating Car Data (FCD). FCD is one of the methods used to gather traffic information; it uses vehicles as sensor nodes that transmit their speed to the server. The traffic information sharing system broadcasts speed information updated by such transmission. Vehicles receiving broadcasted speed information can calculate travel time and select a minimum time route. The communication cost and the load of the server are issues, because such a traffic information sharing system can generate a lot of wireless communication between the vehicles and the server [2][3]. However, reducing the amount of communication lowers the accuracy of information provided by the server. In this paper we propose an Information Cost Model to quantify a trade-off relationship between the communication cost of the system and the accuracy of information. Additionally, we propose a randomized method to reduce the number of messages from clients to the server by avoiding redundant transmissions. We compared the performance of our proposed method with that of a conventional method, using real traffic data from Chicago highways. The result shows that our proposed method generally outperforms the conventional method.