A Neural Network Parallel Algorithm for Channel Assignment Problems in Cellular Radio Networks

Research output: Contribution to journalArticle

193 Citations (Scopus)

Abstract

A parallel algorithm for channel assignment problems in cellular radio networks is presented in this paper. The channel assignment problem involves not only assigning channels or frequencies to each radio cell, but also satisfying frequency constraints given by a compatibility matrix. The proposed parallel algorithm is based on an artificial neural network composed of nm processing elements for an n-cell-m-frequency problem. The algorithm runs not only on a sequential machine but also on a parallel machine with up to a maximum of nm processors. The algorithm was tested by solving eight benchmark problems where the total number of frequencies varied from 100 to 533. The algorithm found the solutions in nearly constant time with nm processors. The simulation results showed that the algorithm found better solutions than the existing algorithm in one out of eight problems.

Original languageEnglish
Pages (from-to)430-437
Number of pages8
JournalIEEE Transactions on Vehicular Technology
Volume41
Issue number4
DOIs
Publication statusPublished - 1992
Externally publishedYes

Fingerprint

Channel Assignment Problem
Radio Networks
Network Algorithms
Cellular Networks
Parallel algorithms
Parallel Algorithms
Neural Networks
Neural networks
Sequential machines
Cell
Parallel Machines
Time Constant
Compatibility
Artificial Neural Network
Benchmark
Processing
Simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Aerospace Engineering
  • Automotive Engineering
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{8d9b25e9a5da4931aa85a2f477bf0330,
title = "A Neural Network Parallel Algorithm for Channel Assignment Problems in Cellular Radio Networks",
abstract = "A parallel algorithm for channel assignment problems in cellular radio networks is presented in this paper. The channel assignment problem involves not only assigning channels or frequencies to each radio cell, but also satisfying frequency constraints given by a compatibility matrix. The proposed parallel algorithm is based on an artificial neural network composed of nm processing elements for an n-cell-m-frequency problem. The algorithm runs not only on a sequential machine but also on a parallel machine with up to a maximum of nm processors. The algorithm was tested by solving eight benchmark problems where the total number of frequencies varied from 100 to 533. The algorithm found the solutions in nearly constant time with nm processors. The simulation results showed that the algorithm found better solutions than the existing algorithm in one out of eight problems.",
author = "Nobuo Funabiki",
year = "1992",
doi = "10.1109/25.182594",
language = "English",
volume = "41",
pages = "430--437",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - A Neural Network Parallel Algorithm for Channel Assignment Problems in Cellular Radio Networks

AU - Funabiki, Nobuo

PY - 1992

Y1 - 1992

N2 - A parallel algorithm for channel assignment problems in cellular radio networks is presented in this paper. The channel assignment problem involves not only assigning channels or frequencies to each radio cell, but also satisfying frequency constraints given by a compatibility matrix. The proposed parallel algorithm is based on an artificial neural network composed of nm processing elements for an n-cell-m-frequency problem. The algorithm runs not only on a sequential machine but also on a parallel machine with up to a maximum of nm processors. The algorithm was tested by solving eight benchmark problems where the total number of frequencies varied from 100 to 533. The algorithm found the solutions in nearly constant time with nm processors. The simulation results showed that the algorithm found better solutions than the existing algorithm in one out of eight problems.

AB - A parallel algorithm for channel assignment problems in cellular radio networks is presented in this paper. The channel assignment problem involves not only assigning channels or frequencies to each radio cell, but also satisfying frequency constraints given by a compatibility matrix. The proposed parallel algorithm is based on an artificial neural network composed of nm processing elements for an n-cell-m-frequency problem. The algorithm runs not only on a sequential machine but also on a parallel machine with up to a maximum of nm processors. The algorithm was tested by solving eight benchmark problems where the total number of frequencies varied from 100 to 533. The algorithm found the solutions in nearly constant time with nm processors. The simulation results showed that the algorithm found better solutions than the existing algorithm in one out of eight problems.

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

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

U2 - 10.1109/25.182594

DO - 10.1109/25.182594

M3 - Article

AN - SCOPUS:0026943333

VL - 41

SP - 430

EP - 437

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 4

ER -