Evaluation of the Performance of Various Polynomial Interpolation Methods for an Effective Key Management MANETs Communication

The unstable and dynamic nature of Mobile Ad Hoc Networks (MANETs) along with the non-availability of a centralized key server rules out the possibility of any key management. Energy-efficient communication along with ensuring security in MANETs turned out to be the two utmost obligations of these types of wireless networks.

Lagrange method, one of the polynomial interpolation methods requires high computational costs for higher-order polynomials as well as it suffers from Runge’s phenomenon. So, other polynomial interpolation methods like Curve fitting, Spline curves and Chebyshev polynomial approaches are mentioned and analyzed in this paper. These approaches genuinely support pervasive security services for MANETs. These methods tend to be robust and scale to any network size. Accuracy in calculating the secret key, memory consumption and time taken are the base parameters on which comparison is being carried out. Simulation results show the performance of all the three approaches that unveils the potential gains of all the methods in calculating the secret key. The comparative analysis shows that the Chebyshev Polynomial approach substantially outperforms Curve Fitting and Spline Curve method in large networks.