A neural network approach to solving the link activation problem in multihop radio networks

Author

Barnhart, C.M. ; Wieselthier, J.E. ; Ephremides, A.

Author_Institution

Div. of Inf. Technol., Naval Res. Lab., Washington, DC, USA

Volume

43

Issue

38020

fYear

1995

Firstpage

1277

Lastpage

1283

Abstract

We address the problem of "link activation" or "scheduling" in multihop packet radio networks. The objective is to determine a conflict-free schedule of minimum length that satisfies the specified end-to-end communication requirements. It is well known that this problem, in almost all of its forms, is a combinatorial-optimization problem of high complexity. We approach this problem by the use of a Hopfield neural network model in which the method of Lagrange multipliers is used to vary dynamically the values of the coefficients used in the connection weights.<>

Keywords

Hopfield neural nets; combinatorial mathematics; packet radio networks; radio links; scheduling; Hopfield neural network model; Lagrange multipliers; coefficients; combinatorial-optimization problem; conflict-free schedule; connection weights; high complexity; link activation; link scheduling; minimum length schedule; multihop packet radio network; neural network; Hopfield neural networks; Lagrangian functions; Neural networks; Packet radio networks; Spread spectrum communication;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.380169

Filename

380169