A grouping genetic algorithm for the microcell sectorization problem
The number of wireless users has steadily increased over the last decade, leading to the need for methods that efficiently use the limited bandwidth available. Reducing the size of the cells in a cellular network increases the rate of frequency reuse or channel reuse, thus increasing the network cap...
Saved in:
Published in | Engineering applications of artificial intelligence Vol. 17; no. 6; pp. 589 - 598 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.09.2004
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The number of wireless users has steadily increased over the last decade, leading to the need for methods that efficiently use the limited bandwidth available. Reducing the size of the cells in a cellular network increases the rate of frequency reuse or channel reuse, thus increasing the network capacity. The drawback of this approach is increased costs associated with installation and coordination of the additional base stations. A code-division multiple-access network where the base stations are connected to the central station by fiber has been proposed to reduce the installation costs. To reduce the coordination costs and the number of handoffs, sectorization (grouping) of the cells is suggested. We propose a dynamic sectorization of the cells, depending on the current sectorization and the time-varying traffic. A grouping genetic algorithm is proposed to find a solution which minimizes costs. The computational results demonstrate the effectiveness of the algorithm across a wide range of problems. The GGA is shown to be a useful tool to efficiently allocate the limited number of channels available. |
---|---|
ISSN: | 0952-1976 1873-6769 |
DOI: | 10.1016/j.engappai.2004.08.003 |