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

Takayuki Baba, Nobuo Funabiki

Research output: Contribution to journalConference article

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
Pages (from-to)2285-2290
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume3
Publication statusPublished - Dec 1 1998
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

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Routing algorithm based on the greedy neural network for non-sequential activation scheduling problems'. Together they form a unique fingerprint.

  • Cite this