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 |
|---|---|
| Title of host publication | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
| Publisher | IEEE |
| Pages | 3948-3953 |
| Number of pages | 6 |
| 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 |
Other
| Other | Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) |
|---|---|
| City | Orlando, FL, USA |
| Period | 10/12/97 → 10/15/97 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Control and Systems Engineering
Cite this
Three-stage heuristic and neural network algorithm for channel assignment in cellular radio networks. / Funabiki, Nobuo; Okutani, Noriko; Nishikawa, Seishi.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 4 IEEE, 1997. p. 3948-3953.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
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 contribution
VL - 4
SP - 3948
EP - 3953
BT - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics
PB - IEEE
ER -