Abstract
In this paper we are concerned with determining the number of dependent and independent paths through a packet radio network in the presence of hostile jammers. A packet radio network consists of a set of transceivers geographically distributed which communicate with each other through wide-band channels. When dealing with a military application there exists the possibility that hostile adversaries may attempt to jam one or more of the transceivers. The problem is to determine the number of paths that must be jammed to sever the communications link between source and destination. It has been shown that determination of the number of independent paths is an NP-complete problem. We propose to solve this task by utilizing a Hopfield net configured in three dimensions. Solutions in each plane of the net are considered potential paths through the communications network. We show that by layering the communications nodes and by proper selection of an energy function we can solve the problem rapidly and reliably.
| Original language | English (US) |
|---|---|
| Pages | 989-994 |
| Number of pages | 6 |
| State | Published - Dec 1 1995 |
| Event | Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95 - St.Louis, MO, USA Duration: Nov 12 1995 → Nov 15 1995 |
Other
| Other | Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95 |
|---|---|
| City | St.Louis, MO, USA |
| Period | 11/12/95 → 11/15/95 |
All Science Journal Classification (ASJC) codes
- Software