Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems

Takayuki Baba, Nobuo Funabiki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper presents the routing algorithm based on the greedy neural network for non-sequential activation scheduling (NAS) problems in multihop radio networks. A multihop radio network with a set of station nodes and a set of communication links can be represented with an connected graph. In order to minimize the number of transmission time slots for given Source-Destination (SD)-pairs, the NAS problem must be solved to assign a transmission route for each SD-pair, and to find a link activation schedule for each assigned route. The simulation results show that our greedy neural network algorithms can find better solutions in the shorter time than the existing algorithms.

Original languageEnglish
Title of host publicationProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Editors Anon
PublisherIEEE
Pages2285-2290
Number of pages6
Volume3
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - San Diego, CA, USA
Duration: Oct 11 1998Oct 14 1998

Other

OtherProceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5)
CitySan Diego, CA, USA
Period10/11/9810/14/98

Fingerprint

Routing algorithms
Chemical activation
Scheduling
Neural networks
Telecommunication links

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Baba, T., & Funabiki, N. (1998). Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems. In Anon (Ed.), Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (Vol. 3, pp. 2285-2290). IEEE.

Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems. / Baba, Takayuki; Funabiki, Nobuo.

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. ed. / Anon. Vol. 3 IEEE, 1998. p. 2285-2290.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baba, T & Funabiki, N 1998, Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems. in Anon (ed.), Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. vol. 3, IEEE, pp. 2285-2290, Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5), San Diego, CA, USA, 10/11/98.
Baba T, Funabiki N. Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems. In Anon, editor, Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 3. IEEE. 1998. p. 2285-2290
Baba, Takayuki ; Funabiki, Nobuo. / Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. editor / Anon. Vol. 3 IEEE, 1998. pp. 2285-2290
@inproceedings{4209dde240a8437bacf138afbee0bf81,
title = "Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems",
abstract = "This paper presents the routing algorithm based on the greedy neural network for non-sequential activation scheduling (NAS) problems in multihop radio networks. A multihop radio network with a set of station nodes and a set of communication links can be represented with an connected graph. In order to minimize the number of transmission time slots for given Source-Destination (SD)-pairs, the NAS problem must be solved to assign a transmission route for each SD-pair, and to find a link activation schedule for each assigned route. The simulation results show that our greedy neural network algorithms can find better solutions in the shorter time than the existing algorithms.",
author = "Takayuki Baba and Nobuo Funabiki",
year = "1998",
language = "English",
volume = "3",
pages = "2285--2290",
editor = "Anon",
booktitle = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",
publisher = "IEEE",

}

TY - GEN

T1 - Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems

AU - Baba, Takayuki

AU - Funabiki, Nobuo

PY - 1998

Y1 - 1998

N2 - This paper presents the routing algorithm based on the greedy neural network for non-sequential activation scheduling (NAS) problems in multihop radio networks. A multihop radio network with a set of station nodes and a set of communication links can be represented with an connected graph. In order to minimize the number of transmission time slots for given Source-Destination (SD)-pairs, the NAS problem must be solved to assign a transmission route for each SD-pair, and to find a link activation schedule for each assigned route. The simulation results show that our greedy neural network algorithms can find better solutions in the shorter time than the existing algorithms.

AB - This paper presents the routing algorithm based on the greedy neural network for non-sequential activation scheduling (NAS) problems in multihop radio networks. A multihop radio network with a set of station nodes and a set of communication links can be represented with an connected graph. In order to minimize the number of transmission time slots for given Source-Destination (SD)-pairs, the NAS problem must be solved to assign a transmission route for each SD-pair, and to find a link activation schedule for each assigned route. The simulation results show that our greedy neural network algorithms can find better solutions in the shorter time than the existing algorithms.

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

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

M3 - Conference contribution

AN - SCOPUS:0032312565

VL - 3

SP - 2285

EP - 2290

BT - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

A2 - Anon, null

PB - IEEE

ER -