By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
C. M. Barnhart ; Div. of Inf. Technol., Naval Res. Lab., Washington, DC, USA ; J. E. Wieselthier ; A. Ephremides

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

Published in:

IEEE Transactions on Communications  (Volume:43 ,  Issue: 2/3/4 )