Research Article
Solving Channel Allocation Problem in Cellular Radio Networks Using Genetic Algorithm
@INPROCEEDINGS{10.1109/COMSWA.2008.4554416, author={Srinivas Pinagapany and A V Kulkarni}, title={Solving Channel Allocation Problem in Cellular Radio Networks Using Genetic Algorithm}, proceedings={3rd International ICST Conference on COMmunication System SoftWAre and MiddlewaRE}, publisher={IEEE}, proceedings_a={COMSWARE}, year={2008}, month={6}, keywords={Genetic algorithms fixed channel allocation dynamic channel allocation adjacent channel interference co-channel interference.}, doi={10.1109/COMSWA.2008.4554416} }
- Srinivas Pinagapany
A V Kulkarni
Year: 2008
Solving Channel Allocation Problem in Cellular Radio Networks Using Genetic Algorithm
COMSWARE
IEEE
DOI: 10.1109/COMSWA.2008.4554416
Abstract
With limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel allocation becomes increasingly important. However, finding a conflict-free channel allocation with the minimum interference and minimum channel span is NP hard. Genetic algorithm is one of the heuristic optimization tools that can be used to solve this problem efficiently. In this paper we investigate fixed and dynamic channel allocation problem (CAP) for cellular networks and its optimum solution using genetic algorithm.
Copyright © 2008–2024 IEEE