A neural network approach to routing in multihop radio networks
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1074-1083 vol.3
- https://doi.org/10.1109/infcom.1991.147623
Abstract
The problem of routing is addressed for the minimization of congestion as a first step toward the solution of the joint routing-scheduling problem in packet radio networks. This is formulated as a combinatorial-optimization problem, and a Hopfield neural network model is developed for its solution. The method of Lagrange multipliers is used, which permits these coefficients to vary dynamically along with the evolution of the system state. Extensive software simulation results demonstrate the ability of this approach to determine good sets of routes in large, heavily-congested networks.Keywords
This publication has 12 references indexed in Scilit:
- Jointly optimal routing and scheduling in packet ratio networksIEEE Transactions on Information Theory, 1992
- Graph partitioning using annealed neural networksIEEE Transactions on Neural Networks, 1990
- Scheduling multihop CDMA networks in the presence of secondary conflictsAlgorithmica, 1989
- A neural network algorithm for the multiple traveling salesmen problemBiological Cybernetics, 1989
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988
- Neural networks for routing communication trafficIEEE Control Systems Magazine, 1988
- A design concept for reliable mobile radio networks with frequency hopping signalingProceedings of the IEEE, 1987
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- Some complexity results about packet radio networks (Corresp.)IEEE Transactions on Information Theory, 1984
- The Design and Simulation of a Mobile Radio Network with Distributed ControlIEEE Journal on Selected Areas in Communications, 1984