Abstract
The objective of this paper is to develop and implement a practical technique to compute optimum or near optimum paths from a single source to multiple destinations in a packet radio network (PRN) environment. This problem is common and is usually solved by making copies of the packet, then addressing and sending them independently to each destination. This type of solution makes for very inefficient use of the 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 a resolution to this problem by employment of the Hopfield neural network.
| Original language | English (US) |
|---|---|
| Pages | 571-576 |
| Number of pages | 6 |
| State | Published - Jan 1 1996 |
| Event | Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) - Washington, DC, USA Duration: Jun 3 1996 → Jun 6 1996 |
Other
| Other | Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) |
|---|---|
| City | Washington, DC, USA |
| Period | 6/3/96 → 6/6/96 |
All Science Journal Classification (ASJC) codes
- Software