Determining the number of dependent and independent paths through packet radio networks using a Hopfield net

Thomas Lee Hemminger, Carlos A. Pomalaza-Raez

Research output: Contribution to conferencePaper

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 languageEnglish (US)
Pages989-994
Number of pages6
StatePublished - Dec 1 1995
EventProceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95 - St.Louis, MO, USA
Duration: Nov 12 1995Nov 15 1995

Other

OtherProceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95
CitySt.Louis, MO, USA
Period11/12/9511/15/95

Fingerprint

Transceivers
Military applications
Telecommunication networks
Telecommunication links
Computational complexity
Communication

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Hemminger, T. L., & Pomalaza-Raez, C. A. (1995). Determining the number of dependent and independent paths through packet radio networks using a Hopfield net. 989-994. Paper presented at Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95, St.Louis, MO, USA, .
Hemminger, Thomas Lee ; Pomalaza-Raez, Carlos A. / Determining the number of dependent and independent paths through packet radio networks using a Hopfield net. Paper presented at Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95, St.Louis, MO, USA, .6 p.
@conference{0782eebb273545ae83c521de0978b4e7,
title = "Determining the number of dependent and independent paths through packet radio networks using a Hopfield net",
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.",
author = "Hemminger, {Thomas Lee} and Pomalaza-Raez, {Carlos A.}",
year = "1995",
month = "12",
day = "1",
language = "English (US)",
pages = "989--994",
note = "Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95 ; Conference date: 12-11-1995 Through 15-11-1995",

}

Hemminger, TL & Pomalaza-Raez, CA 1995, 'Determining the number of dependent and independent paths through packet radio networks using a Hopfield net', Paper presented at Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95, St.Louis, MO, USA, 11/12/95 - 11/15/95 pp. 989-994.

Determining the number of dependent and independent paths through packet radio networks using a Hopfield net. / Hemminger, Thomas Lee; Pomalaza-Raez, Carlos A.

1995. 989-994 Paper presented at Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95, St.Louis, MO, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Determining the number of dependent and independent paths through packet radio networks using a Hopfield net

AU - Hemminger, Thomas Lee

AU - Pomalaza-Raez, Carlos A.

PY - 1995/12/1

Y1 - 1995/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029417667&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029417667&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029417667

SP - 989

EP - 994

ER -

Hemminger TL, Pomalaza-Raez CA. Determining the number of dependent and independent paths through packet radio networks using a Hopfield net. 1995. Paper presented at Proceedings of the 1995 Artificial Neural Networks in Engineering, ANNIE'95, St.Louis, MO, USA, .