Downloading: Data Transfer Based on Between the Node Coverge Area Using Diffe-Hellman Key Algorithm in Adhoc Network
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Open Access | Fully Refereed | Peer Reviewed International Journal

ISSN: 2319-7064



To prevent Server Overload, Your Article PDF will be Downloaded in Next Seconds

Data Transfer Based on Between the Node Coverge Area Using Diffe-Hellman Key Algorithm in Adhoc Network

T. Sankar, M. Prakash

Abstract: We have used a Distributed Time Sequence Routing protocol (DTSR), the DTSR is used to locate the correct relay node and sink node for data transmission. In our wireless network is considered in to neighbors node in the network. Using the node data will be sending in to source to destination. To reduce the energy cost, nodes are active only during data transmission and the intersection of node creates a larger merged node. Then we recognize a particular set of adhoc network applications so as to are flexible to this scalability limit. We are also improving the DTSR roaming with both network size and node density. 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 It enables that adhoc nodes can communicate each other securely. The key distribution to adhoc nodes is done by means of two layer process. This paper proposes a key distribution scheme, based on intrusion detection method for using a data transmission from source to destination on the network. It based high level security and more energy efficient data transmission on their network.

Keywords: ADHOC NETWORK, DIFFE-HELLMAN KEY ALGORITHM, MAN



Top