A Binary Neural Network Approach for Link Activation Problems in Multihop Radio Networks
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents a binary neural network approach for link activation problems in multihop radio networks. The goal of the NP-complete problems is to find a conflict-free link activation schedule with the minimum number of time slots for specified communication requirements. The neural network is composed of N×M binary neurons for scheduling N links in M time slots. The energy functions and the motion equations are newly defined with heuristic methods. The simulation results through 14 instances with up to 419 links show that the neural network not only surpasses the best existing neural network in terms of the convergence rate and the computation time, but also can solve large scale instances within a constant number of iteration steps.
- 社団法人電子情報通信学会の論文
- 1996-08-25
著者
-
Funabiki Nobuo
The Department Of Information And Computer Sciences Faculty Of Engineering Science Osaka University
-
Funabiki Nobuo
The Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka
-
NISHIKAWA Seishi
the Department of Information and Computer Sciences, School of Engineering Science, Osaka University
-
Nishikawa Seishi
The Department Of Information And Computer Sciences Faculty Of Engineering Science Osaka University
関連論文
- Relaxation of Coefficient Sensitiveness to Performance for Neural Networks Using Neuron Filter through Total Coloring Problems
- A Digital Neural Network for Multilayer Channel Routing with Crosstalk Minimization
- A Massive Digital Neural Network for Total Coloring Problems
- A Gradual Neural Network Approach for Time Slot Assignment in TDM Multicast Switching Systems
- Comparisons of Energy-Descent Optimization Algorithms for Maximum Clique Problems (Special Section on Discrete Mathematics and Its Applications)
- A Minimal-State Processing Search Algorithm for Graph Coloring Problems
- A Binary Neural Network Approach for Link Activation Problems in Multihop Radio Networks
- A Neural-Greedy Combination Algorithm for Board-Level Routing in FPGA-Based Logic Emulation Systems(Special Section on Discrete Mathematics and Its Applications)