A binary neural network approach for link activation problems in multihop radio networks

Nobuo Funabiki, Scishi Nishikawa

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

This paper presents a binary neural network approach for link activation problems in multihop radio networks. The goal of the NP-compIete 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 NX At binary neurons for scheduling jV 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.

Original languageEnglish
Pages (from-to)1086-1093
Number of pages8
JournalIEICE Transactions on Communications
VolumeE79-B
Issue number8
Publication statusPublished - 1996
Externally publishedYes

Fingerprint

Telecommunication links
Chemical activation
Neural networks
Heuristic methods
Neurons
Equations of motion
Scheduling
Communication

Keywords

  • Link activation
  • Multihop radio network
  • Neural network
  • Npcomplele
  • Parallel algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

A binary neural network approach for link activation problems in multihop radio networks. / Funabiki, Nobuo; Nishikawa, Scishi.

In: IEICE Transactions on Communications, Vol. E79-B, No. 8, 1996, p. 1086-1093.

Research output: Contribution to journalArticle

@article{5feb330b044144deb3774421d27d6e22,
title = "A binary neural network approach for link activation problems in multihop radio networks",
abstract = "This paper presents a binary neural network approach for link activation problems in multihop radio networks. The goal of the NP-compIete 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 NX At binary neurons for scheduling jV 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.",
keywords = "Link activation, Multihop radio network, Neural network, Npcomplele, Parallel algorithm",
author = "Nobuo Funabiki and Scishi Nishikawa",
year = "1996",
language = "English",
volume = "E79-B",
pages = "1086--1093",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

T1 - A binary neural network approach for link activation problems in multihop radio networks

AU - Funabiki, Nobuo

AU - Nishikawa, Scishi

PY - 1996

Y1 - 1996

N2 - This paper presents a binary neural network approach for link activation problems in multihop radio networks. The goal of the NP-compIete 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 NX At binary neurons for scheduling jV 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.

AB - This paper presents a binary neural network approach for link activation problems in multihop radio networks. The goal of the NP-compIete 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 NX At binary neurons for scheduling jV 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.

KW - Link activation

KW - Multihop radio network

KW - Neural network

KW - Npcomplele

KW - Parallel algorithm

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

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

M3 - Article

AN - SCOPUS:0030219422

VL - E79-B

SP - 1086

EP - 1093

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 8

ER -