The Successful Key Division Using Chord, Pastry, and Kadmelia

In general, key distribution is the process of giving out the public key to the members present in the network. However, the distribution of secret key still remains a problem in most of the network. With the view of proposing an efficient key distribution algorithm, in this project we have demonstrated the key distribution under three different network scenarios as (i) Chord (ii) Pastry and (iii) Kadmelia. In this project, we have considered the peer-to-peer (P2P) network for implementation. Also, the chord and pastry are the overlay and routing network types that are used for the implementation of distributed hash table. Meanwhile, Kadmelia also supports distributed hash table routing but constructs the virtual overlay network. In order to generate the hash value, we used the SHA-I (Secured Hash Algorithm). For each scenario, we implement three algorithms such as (i) Present Encryption, (ii) Routing Information Protocol (RIP) and (iii) Emperor Penguin optimization (EPO). The present encryption is used for data encryption during the transmission and the RIP ensures that is no packet drop. Moreover, the EPO algorithm is used for selecting the next forwarder during query passing in the P2P network. The experiment was performed in the simulation environment of NS 3.26 and the results are presented. The entire scenarios are evaluated under the performance metrics such as packet delivery ratio, throughput, overhead and end-to-end delay. The experimental results proved that the key distribution is better in the scenario of pastry network. This is because of the efficiency in the network topology as well as the deployed algorithm.