To implement a dynamic traffic congestion monitoring system using clusters

Introduction
Finding the best path from getting to one part of the city to another has been the perennial problem for the road user. Most of us know two or three paths to get from one place to another but do not know which to use when. The ubiquitous coin toss may sometimes prevaricate and lead us right into the middle of a traffic jam. We suggest a scheme for doing this in a fairly deterministic fashion through the application of a cluster deployed using the Windows Cluster Server 2003.

Solution
Each node on the cluster deploys n agents into the simulated map of the region. This map will be graph akin to that of the travelling salesman problem. Each of the vertices represent the major points in the region and the edges represent the roads. The weights on the roads will be assigned according to the distance as well as the traffic as well as road conditions which will be updated by external sensors. The agents will travel along the paths which seem to have least weight. They will leave a token on every edge they traverse. This token will expire after some time interval. The next agent to traverse will leave its own token. When all the agents have traversed the graph, the result of all the traversals is taken. The shortest path between any two points is taken as the one with the largest number of tokens. This newly reconstructed optimal city road map is then released into the public domain. This process is run every time a batch of new data arrives regarding the weights of the graphs.

Possible users
The possible users for this system will those who use the roads as a means of transport. Emergency services can know how to reach their destination in swiftest manner possible. Bus drivers choose the most optimal routes between two stops. Ordinary motor car drivers can use this to avoid traffic jams, rush-hour congestions and traffic mishaps.

Possible scenario
It is six ‘o’ clock in Ahmedabad. Rush hour traffic is at it’s peak on the Ashram road and on the Nehru bridge. A traffic mishap has occurred near Subhash Chowk and the Chimanbhai Bridge is being repaired and retarred with the half of the dual carriageway being occupied by road labour. You have to get to Gandhinagar from Navrangpura and you request for directions from the traffic monitoring system. The system which had already received the information beforehand had deployed its ‘agents’ within the ‘city’

to find the optimal road map. You instantly receive directions to go to Gandhinagar via Shahibaug taking the Indira bridge route.

Proposed by:
Ankur Chakraborty, B.Tech. (ICT), Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar, India E-mail: Divey Chandra B.Tech. (ICT), Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar, India E-mail: _chandra@daiict.ac.in Kaustubh B.Tech. (ICT), Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar, India E-mail: kaustubh@daiict.ac.in

Faculty Guide:
Dr. Sanjay Chaudhary Associate Professor, Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar, India E-mail: sanjay_chaudhary@daiict.ac.in Tel: (079)-30510560

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.