Lyapunov Stability Analysis for Consequential Message Path in Graded Cognitive Networks

Provided by: The Society of Digital Information and Wireless Communications (SDIWC)
Topic: Networking
Format: PDF
In the domain of network routing, one of the key measures belongs to the stability analysis of the paths obtained by routing algorithms. Lyapunov analysis has been used widely for understanding the nature of the system output to know the stability intensity. Here in this paper, the authors have compared the performance of two bio-inspired algorithms on a graded surface while determining the path. Also the paper of the Lyapunov analysis is carried out on a restricted search space. Here the Lyapunov function derived are best suited for the path derived on graded surface by memetic and artificial bee colony algorithms. Results show that the path obtained by the bio-inspired algorithms has the required stability as found by Lyapunov function for the transfer of data.

Find By Topic