Premium
A maximum neural network algorithm for route selection problems in multihop radio networks
Author(s) -
Baba Takayuki,
Funabiki Nobuo,
Nishikawa Seishi,
Yoshio Hiroaki
Publication year - 1999
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/(sici)1520-6416(19991115)129:2<78::aid-eej9>3.0.co;2-q
Subject(s) - computer science , network packet , computer network , routing (electronic design automation) , schedule , node (physics) , transmission (telecommunications) , selection (genetic algorithm) , selection algorithm , optimization problem , algorithm , engineering , telecommunications , artificial intelligence , structural engineering , operating system
In a multihop radio network, packets are transmitted from course nodes to destination nodes by activating several links between nodes. Each node can either send a packet to, or receive a packet from, at most one of its adjacent nodes simultaneously. To minimize the transmission time for given requests, the problems must be solved by selecting a transmission route for each request (the routing problem) and by finding a link activation schedule (the link activation problem). The routing problem is decomposed into two subproblems: the candidate extraction problem and the route selection problem. In this paper, we propose a neural network algorithm using the maximum neuron model for the route selection problem. We verify through simulations that our algorithm finds better solutions in a shorter time than the existing algorithms. We also probe the NP‐hardness of this problem. © 1999 Scripta Technica, Electr Eng Jpn, 129(2): 78–86, 1999