Mathematical models of CBSC over wireless channels and their analysis by using the LeNN-WOA-NM algorithm

Abstract In recent studies, several chaos-based secure communication (CBSC) systems are developed and are assumed to be effective and promising tools for balancing communications in wireless applications. The reliability of a wireless communication system is dependent on the synchronization between receiving and transmitting nodes. Therefore, it is crucial to analyze the mathematical models for different enhancements through CBSC and avoid the difficulty in synchronization. We have designed a novel computational paradigm that uses weighted Legendre polynomials to construct series solutions for mathematical models of the Lorenz Chaotic Attractor (LCA) and Double Scroll Attractor (DSA) (with filter and without filter) by using Chua’s circuits. We design fitness functions for each system of differential equations. Two optimization techniques, the Whale Optimization Algorithm (WOA) and the Nelder–Mead (NM) algorithm are adopted to optimize the objective functions and calculate the best set of unknown weights. We name our soft computing paradigm, the LeNN-WOA-NM algorithm. We have compared our results with state-of-the-art, and we establish that the LeNN-WOA-NM algorithm is fast, accurate, and reliable. We present graphical and statistical analysis to further elaborate on the performance of our algorithm.