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

Takayuki Baba, Nobuo Funabiki, Seishi Nishikawa, Hiroaki Yoshio

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)78-86
Number of pages9
JournalElectrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)
Volume129
Issue number2
DOIs
Publication statusPublished - Nov 15 1999
Externally publishedYes

Fingerprint

Neural networks
Networks (circuits)
Chemical activation
Packet networks
Neurons
Hardness

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Maximum neural network algorithm for route selection problems in multihop radio networks. / Baba, Takayuki; Funabiki, Nobuo; Nishikawa, Seishi; Yoshio, Hiroaki.

In: Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi), Vol. 129, No. 2, 15.11.1999, p. 78-86.

Research output: Contribution to journalArticle

@article{c611227e62fc49e383edad20b5457831,
title = "Maximum neural network algorithm for route selection problems in multihop radio networks",
abstract = "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.",
author = "Takayuki Baba and Nobuo Funabiki and Seishi Nishikawa and Hiroaki Yoshio",
year = "1999",
month = "11",
day = "15",
doi = "10.1002/(SICI)1520-6416(19991115)129:2<78::AID-EEJ9>3.0.CO;2-Q",
language = "English",
volume = "129",
pages = "78--86",
journal = "Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)",
issn = "0424-7760",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

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

AU - Baba, Takayuki

AU - Funabiki, Nobuo

AU - Nishikawa, Seishi

AU - Yoshio, Hiroaki

PY - 1999/11/15

Y1 - 1999/11/15

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

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

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

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

U2 - 10.1002/(SICI)1520-6416(19991115)129:2<78::AID-EEJ9>3.0.CO;2-Q

DO - 10.1002/(SICI)1520-6416(19991115)129:2<78::AID-EEJ9>3.0.CO;2-Q

M3 - Article

AN - SCOPUS:0032633345

VL - 129

SP - 78

EP - 86

JO - Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)

JF - Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)

SN - 0424-7760

IS - 2

ER -