Abstract
The problem of scheduling interference-free transmissions with maximum throughput in a multi-hop radio network is NP-complete. The computational complexity becomes intractable as the network size increases. In this paper, the scheduling is formulated as a combinatorial optimization problem. An efficient neural network approach, namely, mean field annealing, is applied to obtain optimal transmission schedules. Numerical examples show that this method is capable of finding an interference-free schedule with (almost) optimal throughput.
| Original language | English (US) |
|---|---|
| Pages | 4699-4703 |
| Number of pages | 5 |
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) - Orlando, FL, USA Duration: Jun 27 1994 → Jun 29 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) |
|---|---|
| City | Orlando, FL, USA |
| Period | 6/27/94 → 6/29/94 |
All Science Journal Classification (ASJC) codes
- Software