This work describes a practical technique for the computation of optimum or near optimum paths from a single source to multiple destinations in a packet radio network (PRN) environment. The problem is common and is usually solved by making copies of the packet, addressing each copy appropriately, then forwarding each copy to its final destination. Although this solution requires a greater communications channel bandwidth it is frequently tolerated because determination of an optimal solution yielding a minimal number of transmissions is NP-complete. This paper proposes a resolution to the problem by employing a Hopfield neural network. Results are compared against optimal solutions derived through exhaustive search.
|Original language||English (US)|
|Number of pages||6|
|Journal||Intelligent Engineering Systems Through Artificial Neural Networks|
|State||Published - Dec 1 1996|
All Science Journal Classification (ASJC) codes