RESTRICTED ROUTING PROTOCOL FOR CONTRIBUTION OF OPTIMIZATION METHOD
Ch. Tejasvi, A. Jaya Chandran · IJITR International Journal of Innovative Technology and Research - IJITR International Journal of Innovative Technology and Research · 2018
Simple secure connections between a random set of network nodes require that each node maintains the n-1 keys for each pair within the state of symmetric encryption and public keys n-1 in the case of unequal encoding where n represents the number of network nodes.In the operation phase of the network, each node finds the length of the primary road connected by using its overlapped neighbors by making simple path requests.A dynamic set of pre-distribution master plans constructed according to symmetric encryption concepts containing secret keys in pairs.In this document, we refer to the network layer because of the underlying layer as well as the encryption layer because the layer overlays.Our proposed option would essentially be to respond to the derived LP problem by loosening all logical constraints within the original problem.The effectiveness of our formula is within the logical LP solution with the complexity of the period that does not exceed the solution of the problem of LP sedative while ensuring the identification of the optimal solution.We note that the main advantage of our formula is that it has the ability to solve the problem of optimal routing for almost any graphic, whether directed or unguided, in addition to weight or not likely.Evaluate the performance, security and consumption characteristics of the network from the proposed format for pre-symmetric and non-uniform methods running on top of the on-demand routing protocols.In order to evaluate performance in our proposed format, we use it in three main pre-distribution methods: 2-UKP, SST, and PAKP, which operate over the dedicated distance vector routing protocol when necessary.