Three-stage heuristic and neural network algorithm for channel assignment in cellular radio networks

Nobuo Funabiki; Noriko Okutani; Seishi Nishikawa

Three-stage heuristic and neural network algorithm for channel assignment in cellular radio networks

Nobuo Funabiki, Noriko Okutani, Seishi Nishikawa

Research output: Contribution to journal › Conference article › peer-review

Abstract

A three-stage algorithm of heuristic search methods and a neural network is presented for the channel assignment problem in cellular mobile communication systems. This NP-complete problem requires to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. The proposed algorithm consists of 1) the regular interval assignment stage, 2) the greedy assignment stage, and 3) the neural network assignment stage. The performance is evaluated through benchmark problems, where our algorithm finds the optimum or near-optimum solutions in all the instances.

Original language	English
Pages (from-to)	3948-3953
Number of pages	6
Journal	Proceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume	4
Publication status	Published - 1997
Externally published	Yes
Event	Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - Orlando, FL, USA Duration: Oct 12 1997 → Oct 15 1997

ASJC Scopus subject areas

Control and Systems Engineering
Hardware and Architecture

Fingerprint Dive into the research topics of 'Three-stage heuristic and neural network algorithm for channel assignment in cellular radio networks'. Together they form a unique fingerprint.

Cite this

@article{d0bdfd451a9941fb9349982e88c470a4,

title = "Three-stage heuristic and neural network algorithm for channel assignment in cellular radio networks",

abstract = "A three-stage algorithm of heuristic search methods and a neural network is presented for the channel assignment problem in cellular mobile communication systems. This NP-complete problem requires to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. The proposed algorithm consists of 1) the regular interval assignment stage, 2) the greedy assignment stage, and 3) the neural network assignment stage. The performance is evaluated through benchmark problems, where our algorithm finds the optimum or near-optimum solutions in all the instances.",

author = "Nobuo Funabiki and Noriko Okutani and Seishi Nishikawa",

year = "1997",

language = "English",

volume = "4",

pages = "3948--3953",

journal = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",

issn = "0884-3627",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) ; Conference date: 12-10-1997 Through 15-10-1997",

}

TY - JOUR

T1 - Three-stage heuristic and neural network algorithm for channel assignment in cellular radio networks

AU - Funabiki, Nobuo

AU - Okutani, Noriko

AU - Nishikawa, Seishi

PY - 1997

Y1 - 1997

N2 - A three-stage algorithm of heuristic search methods and a neural network is presented for the channel assignment problem in cellular mobile communication systems. This NP-complete problem requires to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. The proposed algorithm consists of 1) the regular interval assignment stage, 2) the greedy assignment stage, and 3) the neural network assignment stage. The performance is evaluated through benchmark problems, where our algorithm finds the optimum or near-optimum solutions in all the instances.

AB - A three-stage algorithm of heuristic search methods and a neural network is presented for the channel assignment problem in cellular mobile communication systems. This NP-complete problem requires to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. The proposed algorithm consists of 1) the regular interval assignment stage, 2) the greedy assignment stage, and 3) the neural network assignment stage. The performance is evaluated through benchmark problems, where our algorithm finds the optimum or near-optimum solutions in all the instances.

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

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

M3 - Conference article

AN - SCOPUS:0031381031

VL - 4

SP - 3948

EP - 3953

JO - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

JF - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

SN - 0884-3627

T2 - Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5)

Y2 - 12 October 1997 through 15 October 1997

ER -