The automotive industry in India is one of the fastest growing globally. India manufactures over 11 million vehicles (including 2 wheeled and 4 wheeled) which is creating a heavy problem of traffic control and security. In most of the part, the traffic is controlled based on timer, regardless of density of congestion over a particular area at particular time. In this paper we have came out with an approach, solving the heavy traffic and the automobile security problem with the help of image processing/laser detection and establishing simple adhoc network(using router and PCI cards). The shortest path with minimum cost is decided based on a congestion value which depends on number of vehicles intake, outcome and distance between the source and destination. It also provides a method of local positioning of the automobiles without using satellite communication.

1. Capacity of Ad Hoc Wireless Networks ,Jinyang Li,Charles Blake,Douglas S. J. De Couto,Hu Imm Lee ,Robert Morris, M.I.T. Laboratory for Computer Science
2. OPTEL Communication, available at http://www.optel.com/en/prod_hls_allg.htm
3. Expected Performance of Dijkstra's Shortest Path Algorithm, Andrew V. Goldberg NEC Research Institute ,4 Independence Way,Princeton, NJ 08540 Robert E. Tarjan, Computer Science Department, Princeton University, Princeton, NJ 08858 and NEC Research Institute
4. Ad hoc networks, technologies and protocols, Prasant Mohapatra, University of California‚ Davis, Srikanth V. Krishnamurthy, University of California, Riverside.
5. Multi-agent cooperative intrusion response in mobile adhoc networks,Journal of Systems Engineering and Electronics, Volume 18, Issue 4, December 2007, Pages 785-794,Yi Ping, Zou Futai, Jiang Xinghao, Li Jianhua
6. Ultrasensitive near-infrared laser-induced fluorescence detection in capillary electrophoresis using a diode laser and avalanche photodiode,Journal of Chromatography A, Volume 779, Issues 1-2, 29 August 1997, Pages 185-194,Benjamin L. Legendre Jr., Dixie L. Moberg, Daryl C. Williams, Steven A. Soper
7. Optical confinement and colour separation in a double colour laser scanned photodiode (D/CLSP),Sensors and Actuators A: Physical, Volume 114, Issues 2-3, 1 September 2004, Pages 219-223,M. Vieira, M. Fernandes, P. Louro, A. Fantoni, I. Rodrigues
8. A theorem on the expected complexity of dijkstra's shortest path algorithm,Journal of algorithms, Volume 6, Issue 3, September 1985, Pages 400-408,Kohei Noshita
9. Building a Rural Wireless Mesh Network, David Johnson, Karel Matthee, Dare Sokoya, Lawrence Mboweni, Ajay Makan, and Henk Kotze,Wireless Africa, Meraka Institute, South Africa
10. A Partial Bandwidth reservation Scheme for QoS support in Ad Hoc networks, 2010 Second International Conference on Computer Engineering and Applications by Rong Geng and Lei Guo.
11. Raptor Code for Wireless Ad Hoc Vehicular Safety Broadcast, IEEE Globecom 2010 Workshop on Mobile Computing and Emerging Communication Networks by Nor Fadzilah Abdullah, Robert J. Piechocki and Angela Doufexi
12. Role-Based Multicast in Highly mobile sparsely connected adhoc networks ,2000 IEEE by Gunter Hommel and Linda Briesemeister
13. Scalable Routing Strategies for Ad Hoc Wireless Networks, IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 17, NO. 8, AUGUST 1999 by Atsushi Iwata, Ching-Chuan Chiang, Guangyu Pei, Mario Gerla, and Tsu-Wei Chen.
14. A* Prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints, IEEE INFOCOM 2001by Gang Liu and K.G.Ramakrishnan

image processing laser detection adhoc