![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|||||||||||||||||
![]() |
![]() |
![]() |
![]() |
|||||||||||||||
![]() |
![]() |
|||||||||||||||||
![]() |
![]() |
![]() |
![]() |
|||||||||||||||
![]() |
![]() |
|||||||||||||||||
![]() |
![]() |
![]() |
||||||||||||||||
![]() |
![]() |
|||||||||||||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
CTS Events
SEMINAR
November 14, 2012 Dr. Nebiyou Tilahun, UPP, presents a seminar entitled "An agent based model of origin destination estimation (ADOBE)" Wednesday, November 14th at 4:00 pm in Rm 1127 SEO
SEMINAR
November 7, 2012 Mr. Thomas Murtha, CMAP, will address the CTS-IGERT community at 4:00 p.m. in Room 1127 SEO.
SEMINAR
October 24, 2012 Please join us in welcoming Dr. Bo Zou, CME, on Wednesday, October 24th, Room 1127 SEO, 4:00 p.m.
CTS Happenings
September 25, 2012
Award Received by Joshua Auld, CTS-IGERT alumnus.
April 20, 2012
Congratulations to James Biagioni, CTS Fellow and CS PhD candidate, winner of the Dean's Scholar award.
January 2, 2012
James Biagioni, CTS Fellow, receives "Best Presentation Award" at SenSys2011
July 30, 2010
Dr. Ouri Wolfson, Dr. Phillip Yu, and Leon Stenneth, CS student and CTS Associate, recently had a paper accepted to the 6th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2010).
March 5, 2009
Daniel Ayala will present his work on Game Theoretic Randomization for Traffic Information Sharing Systems Time: 2:00 pm Location: SEO 1000 ABSTRACT In this presentation 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 server then broadcasts the updated speed data to all vehicles on the road so that vehicles can compute optimal travel routes based on current traffic data. The vehicles then act as distributed agents that will together compute new updated speed values on the server. The cost of communication and load on the server are issues on this system since many vehicles on the road can generate a significant amount of communication between the vehicles and the server. A server update policy is necessary to reduce the communication load on the server, maintain the integrity of the data that will be broadcasted to the cars, and limit the communication to the server based on the bandwidth limit to the server. Update policies previously presented did not address the problem with the bandwidth limit. To address this problem we present a game theoretic model and propose the Game Theory based update policy that takes into account the bandwidth limit when computing which cars will or will not send data to the server. We compared the performance of our proposed method with that of previous methods, the Information Cost based update policy and the Deterministic policy, by using real traffic data from Chicago highways. The result shows that our proposed method generally outperforms the other update policies. |
![]() |