A maximum neural network algorithm for route selection problems in multihop radio networks
-
- Baba Takayuki
- Osaka University
-
- Funabiki Nobuo
- Osaka University
-
- Nishikawa Seishi
- Osaka University
-
- Yoshio Hiroaki
- Matsushita Electric Industrial Co. Ltd.
Bibliographic Information
- Other Title
-
- マキシマム・ニューラルネットワークによる無線通信網の通信経路選択法の提案
- マキシマム ニューラル ネットワーク ニヨル ムセン ツウシンモウ ノ ツウシ
Search this article
Abstract
In a multihop radio network, packets are transmitted from source 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. In order 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 sub-problems: 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 shorter time than the existing algorithms. We also prove the NP-hardness of this problem.
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 117 (7), 874-880, 1997
The Institute of Electrical Engineers of Japan
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390001204608083584
-
- NII Article ID
- 10000077458
- 130006843840
- 10002810728
-
- NII Book ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL BIB ID
- 4248149
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed