Shortest path routing algorithm based on chaotic neural networks

Representing the shortest path problem as a combinational optimization problem, this paper presents a shortest path routing algorithm based on CNN. The expressions of network cost and shortest path are given. The motion equations of neurons are obtained by means of the model of CNN. An energy function is constructed which takes into account all objectives and constraints. It applies the CNN algorithm to 9-node and 15-node network model, respectively. The shortest path could be found for single and multiple packets request. Simulation results show it validating that using chaotic noise neural network to solve the shortest path problem in a communication network.