In a radio communications network, all of the nodes cannot communicate with each other directly. Then packets are transferred from a source node to a destination node through several nodes. Therefore, we need to schedule transfer timing at each node, and communications routes must be assigned to min
โฆ LIBER โฆ
A neural network combined two-stage algorithm for route assignment problems with reliability satisfaction in multihop radio networks
โ Scribed by Takayuki Baba; Nobuo Funabiki; Shigeto Tajima
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 302 KB
- Volume
- 85
- Category
- Article
- ISSN
- 1042-0967
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A proposal of a greedy neural network fo
โ
Takayuki Baba; Nobuo Funabiki; Seishi Nishikawa
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 240 KB
๐ 1 views
An expanded maximum neural network algor
โ
Katsuyoshi Ikenaga; Yoichi Takenaka; Nobuo Funabiki
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 247 KB
๐ 2 views
In this paper, we propose a neural network algorithm that uses the expanded maximum neuron model to solve the channel assignment problem of cellular radio networks, which is an NP-complete combinatorial optimization problem. The channel assignment problem demands minimizing the total interference be