An Effective Diffie-Hellman Key Based New Rsu Detection Secure Routing In Vanets

International Journal of Electronics and Communication Engineering
© 2014 by SSRG - IJECE Journal
Volume 1 Issue 3
Year of Publication : 2014
Authors : Indu.I.R and Prof.R.G.Sakthivelan
How to Cite?

Indu.I.R and Prof.R.G.Sakthivelan, "An Effective Diffie-Hellman Key Based New Rsu Detection Secure Routing In Vanets," SSRG International Journal of Electronics and Communication Engineering, vol. 1,  no. 3, pp. 6-10, 2014. Crossref,


vehicles that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis.And designed the new Road Side unit act as a base station. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. In our network to using a movable nodes from one place to another, that time the attacker to hack the data on network. The Diffie-Hellman Key Exchange is one of the more popular and interesting methods of key distribution. It is a public-key cryptographic system whose sole purpose is for distributing keys, whereby it is used to exchange a single piece of information, and where the value obtained is normally used as a session key for a private-key scheme. In this paper, we propose a new RSU scheduling in which an RSU builds an agenda that is separated into time slots (TSs). In each time slot, all users that are predictable to connect to the RSU are specified. Therefore, an RSU prepares users’ data and caches them during a free TS before the users connect. Using this scheme, the RSU distributes its load among the available TSs. The key distribution to nodes is done by means of two layer process. This project implements a key distribution scheme, based on intrusion detection method for using a data transmission from source to destination on the network. It is based on high level security and more energy efficient data transmission on their network.


Rsu Scheduling, TSs,Diffie-Hellman Key Exchange


[1]. M. Raya and J. P. Hubaux, “The security of vehicular ad hoc networks,” in Proc.SASN, Alexandria, VA, Nov. 2005, pp. 11–21.
[2]. K. Sampigethava, L. Huang, M. Li, R. Poovendran, K. Matsuura, and K. Sezaki,“AMOEBA: Robust location privacy scheme for VANET,” IEEE J. Sel. Areas Commun., vol. 25, no. 8, pp. 1569–1589, Oct. 2007 
[3]. C. T. Li, M. S. Hwang, and Y. P. Chu, “A secure and efficient communication scheme with authenticated key establishment and privacy preserving for vehicular ad hoc networks,” Comput. Commun., vol.
31, no. 12, pp. 2803–2814, Jul. 2008 
[4]. H. Zhu, R. Lu, X. Shen, and X. Lin, “Security in service-oriented vehicular networks,” IEEE WirelessCommun., vol. 16, no. 4, pp. 16–22, Aug. 2008.
[5]. C. Lochert, B. Scheuermann, C. Wewetzer, A. Luebke, and M. Mauve, “Data aggregation and roadside unit placement for a VANET traffic information system,” in Proc. 5th ACM Int. Workshop VANET, San Francisco, CA, Sep. 2008, pp. 58–65.
[6]. P. Papadimitratos, L. Buttyan, T. Holczer, E. Schoch, J. Freudiger, M. Raya, Z. Ma, F. Kargl, A. Kung, and J. P. Hubaux, “Secure vehicular communication systems: Design and architecture,” IEEE Commun. Mag., vol.
46, no. 11, pp. 100–109, Nov. 2008
[7]. J. Petit and Z. Mammeri, “Analysis of authentication overhead in vehicular networks,” in Proc. WMNC, Budapest, Hungary, Oct. 2011, pp. 1–6.
[8]. K. Mershad, H. Artail, and M. Gerla, “ROAMER: Roadside Units as message routers in VANETs,” Ad Hoc Netw., vol. 10, no. 3, pp. 479–496, May 2012.
[9]. K. Mershad and H. Artail, “SCORE: Data scheduling at roadside units in vehicle ad hoc networks,” in Proc. ICT, Jounieh, Lebanon, Apr. 2012, pp. 1–6.
[10]. Khaleel Mershad and Hassan Artail ”A Framework for Secure and Efficient Data Acquisition in Vehicular Ad Hoc Networks” in vehicular technology, vol. 62, no.2, feb 2013.