Title :
A routing algorithm based on the greedy neural network for non-sequential activation scheduling problems
Author :
Baba, Takayuki ; Funabiki, Nobuo
Author_Institution :
Dept. of Inf. & Math. Sci., Osaka Univ., Japan
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 a 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
Keywords :
graph theory; neural nets; packet radio networks; radio links; scheduling; telecommunication computing; telecommunication network routing; communication links; connected graph; greedy neural network; multihop radio networks; nonsequential activation scheduling; route assignment; routing algorithm; source-destination pair; station nodes; transmission time slots; Clocks; Convergence; Informatics; Neural networks; Neurons; Radio network; Routing; Scheduling algorithm; Spread spectrum communication; Synthetic aperture sonar;
Conference_Titel :
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7803-4778-1
DOI :
10.1109/ICSMC.1998.724996