SUMMARYThe radio network is a large-scale communication network in which a large number of stations are distributed over a wide area. Each station can communicate directly by radio packets only with neighborhood stations. Packet communication between stations which cannot communicate directly is realized by passing packets through multiple stations between them. For this purpose, when a packet communication request arises, the route for the packet and the transfer timing must be chosen so that the total transfer time is minimized and the efficiency of the radio network is maximized. It should be noted that the reliability, representing the probability that the required performance is achieved, fluctuates among the stations in the network due to the differences in the time of installation, the designed performance, and communication congestion. Consequently, this paper proposes a two-stage algorithm in which the route is assigned so that its reliability is larger than the required value. The proposed algorithm is composed of the iterative reliability satisfaction extraction procedure, in which a set of path candidates satisfying the reliability condition for the given transfer request, and the greedy neural network procedure, in which the route minimizing the cost is selected from the set of path candidates. The effectiveness of the proposed algorithm is demonstrated by simulation for networks with up to 500 stations.