Maximum neural network algorithm for route selection problems in multihop radio networks

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.