A Binary Neural Network Approach for Link Activation Problems in Multihop Radio Networks

• FUNABIKI Nobuo

  Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University

• NISHIKAWA Seishi

  Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University

抄録

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.

収録刊行物

• IEICE transactions on communications

  IEICE transactions on communications 79 (8), 1086-1093, 1996-08-25

  一般社団法人電子情報通信学会

キーワード

• multihop radio network
• link activation
• NPcomplete
• neural network
• parallel algorithm

詳細情報

• CRID: 1570291227535675008
• NII論文ID: 110003217671
• NII書誌ID: AA10826261
• ISSN: 09168516
• 本文言語コード: en
• データソース種別:
  • CiNii Articles