This paper describes two practical techniques which can be implemented to compute optimum or near optimum paths from a single source to multiple destinations in a packet radio network (PRN) environment. This problem is usually solved by making copies of the packet, then addressing and sending them along paths which have been computed independently without concern for a global optimization. This form of solution requires a greater communications channel bandwidth yet is frequently tolerated because determination of an optimal solution yielding a minimal number of transmissions is NP-complete. This paper proposes two alternative solutions to the problem, one of which is based on neural networks and the other employing heuristic algorithms. Extensive simulation results show that both methods compare very favorably with the exact solution method (exhaustive search).
|Original language||English (US)|
|Number of pages||5|
|Publication status||Published - Dec 1 1996|
|Event||Proceedings of the 1996 4th International Symposium on Spread Spectrum Techniques & Applications, ISSSTA'96 - Mainz, Ger|
Duration: Sep 22 1996 → Sep 25 1996
|Other||Proceedings of the 1996 4th International Symposium on Spread Spectrum Techniques & Applications, ISSSTA'96|
|Period||9/22/96 → 9/25/96|