Dynamic Channel Assignment Using Neural Networks

Main Article Content

S. M. Hadi
Z. K. Ahmed

Abstract

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

Article Details

How to Cite
Dynamic Channel Assignment Using Neural Networks. (2019). Ibn AL-Haitham Journal For Pure and Applied Sciences, 18(2), 78-89. https://jih.uobaghdad.edu.iq/index.php/j/article/view/2213
Section
Computer

How to Cite

Dynamic Channel Assignment Using Neural Networks. (2019). Ibn AL-Haitham Journal For Pure and Applied Sciences, 18(2), 78-89. https://jih.uobaghdad.edu.iq/index.php/j/article/view/2213