Neural network based near-optimal routing algorithm

Chang Wook Ahn; R. S. Ramakrishna; In Chan Choi; Chung Gu Kang

doi:10.1109/ICONIP.2002.1198978

Neural network based near-optimal routing algorithm

Chang Wook Ahn, R. S. Ramakrishna, In Chan Choi, Chung Gu Kang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

Presents a neural network based near-optimal routing algorithm. It employs a modified Hopfield neural network (MHNN) as a means to solve the shortest path problem. It also guarantees a speedy computation that is appropriate to multi-hop radio networks. The MHNN uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs.

Original language	English
Title of host publication	ICONIP 2002 - Proceedings of the 9th International Conference on Neural Information Processing: Computational Intelligence for the E-Age
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1771-1776
Number of pages	6
Volume	4
ISBN (Print)	9810475241, 9789810475246
DOIs	https://doi.org/10.1109/ICONIP.2002.1198978
Publication status	Published - 2002
Event	9th International Conference on Neural Information Processing, ICONIP 2002 - Singapore, Singapore Duration: 2002 Nov 18 → 2002 Nov 22

Other

Other	9th International Conference on Neural Information Processing, ICONIP 2002
Country/Territory	Singapore
City	Singapore
Period	02/11/18 → 02/11/22

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems
Signal Processing

Access to Document

10.1109/ICONIP.2002.1198978

Cite this

Ahn, C. W., Ramakrishna, R. S., Choi, I. C., & Kang, C. G. (2002). Neural network based near-optimal routing algorithm. In ICONIP 2002 - Proceedings of the 9th International Conference on Neural Information Processing: Computational Intelligence for the E-Age (Vol. 4, pp. 1771-1776). Article 1198978 Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICONIP.2002.1198978

Neural network based near-optimal routing algorithm. / Ahn, Chang Wook; Ramakrishna, R. S.; Choi, In Chan et al.
ICONIP 2002 - Proceedings of the 9th International Conference on Neural Information Processing: Computational Intelligence for the E-Age. Vol. 4 Institute of Electrical and Electronics Engineers Inc., 2002. p. 1771-1776 1198978.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ahn, CW, Ramakrishna, RS, Choi, IC & Kang, CG 2002, Neural network based near-optimal routing algorithm. in ICONIP 2002 - Proceedings of the 9th International Conference on Neural Information Processing: Computational Intelligence for the E-Age. vol. 4, 1198978, Institute of Electrical and Electronics Engineers Inc., pp. 1771-1776, 9th International Conference on Neural Information Processing, ICONIP 2002, Singapore, Singapore, 02/11/18. https://doi.org/10.1109/ICONIP.2002.1198978

@inproceedings{a5491030fa1c4fec940bd67bf1155db9,

title = "Neural network based near-optimal routing algorithm",

abstract = "Presents a neural network based near-optimal routing algorithm. It employs a modified Hopfield neural network (MHNN) as a means to solve the shortest path problem. It also guarantees a speedy computation that is appropriate to multi-hop radio networks. The MHNN uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs.",

author = "Ahn, {Chang Wook} and Ramakrishna, {R. S.} and Choi, {In Chan} and Kang, {Chung Gu}",

year = "2002",

doi = "10.1109/ICONIP.2002.1198978",

language = "English",

isbn = "9810475241",

volume = "4",

pages = "1771--1776",

booktitle = "ICONIP 2002 - Proceedings of the 9th International Conference on Neural Information Processing: Computational Intelligence for the E-Age",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "9th International Conference on Neural Information Processing, ICONIP 2002 ; Conference date: 18-11-2002 Through 22-11-2002",

}

TY - GEN

T1 - Neural network based near-optimal routing algorithm

AU - Ahn, Chang Wook

AU - Ramakrishna, R. S.

AU - Choi, In Chan

AU - Kang, Chung Gu

PY - 2002

Y1 - 2002

N2 - Presents a neural network based near-optimal routing algorithm. It employs a modified Hopfield neural network (MHNN) as a means to solve the shortest path problem. It also guarantees a speedy computation that is appropriate to multi-hop radio networks. The MHNN uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs.

AB - Presents a neural network based near-optimal routing algorithm. It employs a modified Hopfield neural network (MHNN) as a means to solve the shortest path problem. It also guarantees a speedy computation that is appropriate to multi-hop radio networks. The MHNN uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs.

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

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

U2 - 10.1109/ICONIP.2002.1198978

DO - 10.1109/ICONIP.2002.1198978

M3 - Conference contribution

AN - SCOPUS:84966440400

SN - 9810475241

SN - 9789810475246

VL - 4

SP - 1771

EP - 1776

BT - ICONIP 2002 - Proceedings of the 9th International Conference on Neural Information Processing: Computational Intelligence for the E-Age

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 9th International Conference on Neural Information Processing, ICONIP 2002

Y2 - 18 November 2002 through 22 November 2002

ER -

Neural network based near-optimal routing algorithm

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this