TY - GEN
T1 - Intelligent traffic management system
AU - Manikonda, Prithvinath
AU - Yerrapragada, Anil Kumar
AU - Annasamudram, Sai Sasank
PY - 2011/12/22
Y1 - 2011/12/22
N2 - This paper presents an intelligent traffic management system using RFID technology. The system is capable of providing practically important traffic data which would aid in reducing the travel time for the users. Also, it can be used for other purposes like tracing of stolen cars, vehicles that evade traffic signals/tickets, toll collection or vehicle taxes etc. The system consists of a passive tag, an RFID reader, a microcontroller, a GPRS module, a high-speed server with a database system and a user module. Using RFID technology, this system collects the required data and calculates average speed of vehicles on each road of a city under consideration. It then transmits the acquired data i.e., average speed calculated at various junctions to the central computation server which calculates the time taken by a vehicle to travel in a particular road. Through Dijkstra's algorithm, the central server computes the fastest route to all the nodes (junctions) considering each node as the initial point in the city. Therefore, the system creates a map of shortest time paths of the whole city. This data is accessed by users through an interface module placed in their vehicles.
AB - This paper presents an intelligent traffic management system using RFID technology. The system is capable of providing practically important traffic data which would aid in reducing the travel time for the users. Also, it can be used for other purposes like tracing of stolen cars, vehicles that evade traffic signals/tickets, toll collection or vehicle taxes etc. The system consists of a passive tag, an RFID reader, a microcontroller, a GPRS module, a high-speed server with a database system and a user module. Using RFID technology, this system collects the required data and calculates average speed of vehicles on each road of a city under consideration. It then transmits the acquired data i.e., average speed calculated at various junctions to the central computation server which calculates the time taken by a vehicle to travel in a particular road. Through Dijkstra's algorithm, the central server computes the fastest route to all the nodes (junctions) considering each node as the initial point in the city. Therefore, the system creates a map of shortest time paths of the whole city. This data is accessed by users through an interface module placed in their vehicles.
UR - https://www.scopus.com/pages/publications/83755163034
UR - https://www.scopus.com/inward/citedby.url?scp=83755163034&partnerID=8YFLogxK
U2 - 10.1109/STUDENT.2011.6089337
DO - 10.1109/STUDENT.2011.6089337
M3 - Conference contribution
AN - SCOPUS:83755163034
SN - 9781457704444
T3 - 2011 IEEE Conference on Sustainable Utilization Development in Engineering and Technology, STUDENT 2011
SP - 119
EP - 122
BT - 2011 IEEE Conference on Sustainable Utilization Development in Engineering and Technology, STUDENT 2011
T2 - 2011 IEEE Conference on Sustainable Utilization Development in Engineering and Technology, STUDENT 2011
Y2 - 20 October 2011 through 21 October 2011
ER -