A neural network combined two-stage algorithm for route assignment problems with reliability satisfaction in multihop radio networks

Takayuki Baba, Nobuo Funabiki, Shigeto Tajima

Research output: Contribution to journalArticle

Abstract

The 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.

Original languageEnglish
Pages (from-to)63-73
Number of pages11
JournalElectronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume85
Issue number6
DOIs
Publication statusPublished - Jun 2002
Externally publishedYes

Fingerprint

Television networks
Neural networks
Communication
Telecommunication networks
Costs

Keywords

  • Combinatorial optimization problem
  • Neural network
  • Radio network
  • Reliability

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

@article{7e96beb7b97d4d5395d0d72a1720406b,
title = "A neural network combined two-stage algorithm for route assignment problems with reliability satisfaction in multihop radio networks",
abstract = "The 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.",
keywords = "Combinatorial optimization problem, Neural network, Radio network, Reliability",
author = "Takayuki Baba and Nobuo Funabiki and Shigeto Tajima",
year = "2002",
month = "6",
doi = "10.1002/ecjc.1102",
language = "English",
volume = "85",
pages = "63--73",
journal = "Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)",
issn = "1042-0967",
publisher = "John Wiley and Sons Inc.",
number = "6",

}

TY - JOUR

T1 - A neural network combined two-stage algorithm for route assignment problems with reliability satisfaction in multihop radio networks

AU - Baba, Takayuki

AU - Funabiki, Nobuo

AU - Tajima, Shigeto

PY - 2002/6

Y1 - 2002/6

N2 - The 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.

AB - The 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.

KW - Combinatorial optimization problem

KW - Neural network

KW - Radio network

KW - Reliability

UR - http://www.scopus.com/inward/record.url?scp=0036604819&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036604819&partnerID=8YFLogxK

U2 - 10.1002/ecjc.1102

DO - 10.1002/ecjc.1102

M3 - Article

VL - 85

SP - 63

EP - 73

JO - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 1042-0967

IS - 6

ER -