• Please send your full manuscript to: jocm@vip.163.com

Secure Neighbour Discovery: Secure k-Nearest ROUTING AD-HOC Networking Using Diffie-Helman and HIGHEST Connectivity Algorithm

Dhanabal S 1, Prasanna Venkatesan G. K. D 2,Amudhavalli P3
1. Research Scholar, Department of Computer science Engineering, Karpagam Academy of Higher Education, Coimbatore, Tamil Nadu, India
2. Research Supervisor, Dean-Faculty of Engineering, Karpagam Academy of Higher Education, Coimbatore, Tamil Nadu, India
3. Department of Computer science Engineering, Karpagam Academy of Higher Education, Coimbatore, Tamil Nadu, India.
Abstract—The approach of splendid flexible contraptions and zone-based applications, and customers’ movability configuration are seen to be exceedingly dependent on moving zones. Proficiency and effortlessness of irregular algorithms have made transfer of data a lucrative option for taking care of complex issues in the space of correspondence systems. Achieving efficiency with the mobility of wireless communication is tedious. To deal with this, the data are sent through the chosen nodes. The data are forwarded to a destination via the primary path from source. Remote framework organizations rely highly on a basic structure for neighborhood discovery (ND). Neighborhood Discovery (ND) is the disclosure of gadgets specifically reachable for correspondence or in physical nearness, which becomes a key necessity and building obstruct for different data transfer applications. A completely conveyed and agreeable arrangement that is powerful against free and plotting foes can be weakened just by a staggering nearness of enemies and distributed solution for (Neighbor Position Verification) NPV, which permits any hub in a portable unplanned system to confirm the situation of its correspondence neighbors without considering the prior reliable nodes. Deffie-Hellman (DH) algorithm and HCS clustering algorithm have been implemented to make safe transmission between nodes and receiving nodes or clients without any traffic or data loss. The data are passed to destination by using grid topology. Our comparison of the proposed system with existing systems demonstrates that our convention is exceptionally strong concerning communication.

Index Terms—Secure ND, Network communication, DH algorithm, Clustering algorithm, HCS algorithm.

Cite: Dhanabal S, Prasanna Venkatesan G. K. D, and Amudhavalli P, " Secure Neighbour Discovery: Secure k-Nearest ROUTING AD-HOC Networking Using Diffie-Helman and HIGHEST Connectivity Algorithm," Journal of Communications, vol. 14, no. 3, pp. 164-169, 2019. Doi: 10.12720/jcm.14.3.164-169.
Copyright © 2013-2019 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com