OPTIMIZATION OF CO-CHANNEL

INTERFERENCE IN CELLULAR NETWORK USING

GENETIC ALGOLRITHM.

BY
YAKUB, YUSUF BABAITA.
UIL/PG2015/0774.
SUBMITTED TO:
DR. J.F OPADIJI
ELE803(ASSIGNMENT)

April, 5th 2016

1

ABSTRACT
Cellular systems are widely used today and cellular technology needs to
offer very efficient use of available frequency spectrum, with millions of mobile
phone in used around the world today. It is necessary to reuse the available
frequency many times over without mutual interference of one cell phone to the
other.
As cellular phones become ubiquitous, there is a continuously growing
demand for mobile communication. Interference became one of the major
limiting factors in cellular systems which affect the quality of service, resulting in
background noise, crosstalk or drop calls. In this report we shall study how we can
minimized these interference using genetic algorithm with the help of Matlab.

INTRODUCTION
A cellular network or mobile network is a communication network were
the last link is wireless. The network is distributed over land area called cells, each
served by at least one fixed location transceiver known as the base station. This
base station provides the cell with the network coverage which can be used for
transmission of voice, data, and others. In a cellular network each cell uses a
different set of frequencies from neighboring cells to avoid interference and
provide guaranteed bandwidth within each cell[1].
In order to achieve higher capacity, that is to support a larger number of
users. The cities must first be divided into smaller cell and each cell must have a
transmitting tower called the base station. The transmitter at the base station has
its own coverage area known as cell and each cell is assign a group of channels for
communication. A group of cell is known as cluster.
The neighboring base station are assigned different group of channel so as
to minimized interference. Frequency, timeslot, codes forms the channel with
which the mobile communicate. As the demand for mobile communication
increases, the number of base station may be increased there by providing
additional capacity and need for frequency may also increase to meet the
demand of the customer. In order to meet this demand, so we have to come up
with this notation of reused distance and frequency planning.

A cell

A cluster

FREQUENCY REUSED PLANNING

The design procedure for allocating cells for the cellular base station
within a system is called frequency reuse or frequency planning. By design of
antennas the coverage area is limited within the cell, and the same group of
frequency is reused to cover another cell separated by a large enough distance to
keep co-channel interference within limit. A cell is represented by a hexagonal
shape just for the sake of clarity, but in real life cells are irregular in shape.
Frequency reused is done in term of clusters were you reuse the frequency band
and replicate that cluster over the entire geographical area.[2]
Suppose I have a cluster of seven cells, each cell having different
frequency band. These frequencies cannot interfere with each other because they
are not using the same frequency. So this cluster needs to be replicated
throughout the geographical area needed to be covered. Note that the distance
between cell 1 and the replicated cell 1, cell 2 and replicated cell 2 are the same.
This distance is known as reused distance denoted by D and the cells are called
co-channel cells. These co-channel cells can interfere with each other since they
are using the same frequency band depending on distance between them.

Reuse distance

1
1
6

2
7

5
3

3
4

Co-channel cell

GENETIC ALGORITHM
Genetic algorithms are a type of optimization algorithm, meaning they are
used to find the optimal solution(s) to a given computational problem that
maximizes or minimizes a particular function. Genetic algorithms represent one
branch of the field of study called evolutionary computation, is that they imitate
the biological processes of reproduction and natural selection to solve for the
fittest solution Like in evolution, many of a genetic algorithm processes are
random, however this optimization techniques allows one to set the level of
randomization and the level of control. These algorithm are far more powerful
and efficient than random search and exhaustive algorithm, yet require no extra
information about the given problem. This feature allows them to find solution to
problems that other optimization methods cannot handle due to lack of
continuity, derivatives, linearity, or other features.[3] Some parameters used for
genetic algorithm are as follows:

1. Mutation: mutation functions make small random changes in the

individuals in the population, which provide genetic diversity and enable
the genetic algorithm to search a broader space.
2. Selection: the selection function chooses parents for the next generation
based on their scaled values from the fitness scaling function.
3. Crossover: Crossover combines two individuals, or parents, to form a new
individual, or child, for the next generation.
4. Fitness function (required) is the objective function you want to minimize.

PROBLEM DEFINATION
Interference is the major factor in the performance of a cellular system.
It causes degradation of signal quality, it introduce bit errors in the receive signal,
it is an unwanted signal. Mobile station and base station are exposed to different
interference situation. There are two major type of interference which are;
1. Adjacent channel interference: these are interference resulting from signal
adjacent in frequency to the desired signal. It can occur as a result of
imperfect receiver filters which allow nearby frequency to leak into the
pass band. Adjacent channel interference can be minimized through careful
filtering and channel assignment.
2. Co-channel interference: this occur as a result of frequency reuse, because
several cell uses the same set of frequency. To reduce co-channel
interference, co channel cell must be physically separated by a minimum
distance to provide sufficient isolation due to propagation [4]. In order to
minimize interference, the reuse distance should be large as possible which
is the function of the cell radius and can be expressed as
D=
Where D is the reuse distance, N is the number of cells and R is the cell
radius in kilometers.[4] These can lead to optimization problem to be
solved using genetic algorithm.
SYSTEM MODEL
In this case we shall consider three different clusters with different number
of cells and determine the value of R that maximized the given function.
Optimizing cell radius
Dmax = 3N1R1 + 3N2R2 + 3N3R3
Subject to
1 R 10
R1+R2 +R3 =20
Assuming N = 7,12,19
6

MODEL SIMULATION
This model was simulated using genetic algorithm and it was run on
Matlab. The Matlab code is shown below;

% optimization of cell radius

% D is the reuse distance
% R is the cell radius
% N is number of cell in the cluster.
function D = optimizingcellradius_fxn(R);
N(1) = 7;
N(2) = 12;
N(3) = 19;
D = -(sqrt(3*N(1)*R(1))+ sqrt(3*N(2)*R(2))+ sqrt(3*N(3)*R(3)));
function [c, ceq] = optimizingcellradius_constraint(R)
c = [R(1)+R(2)+R(3)-20];
ceq = [];
fitnessfcn = @optimizingcellradius_fxn;
nvars = 3;
constraintfunction = @optimizingcellradius_constraint;
LB = [1,1,1];
UB = [12,12,12];
[R] = ga(fitnessfcn,nvars,[],[],[],[],LB,UB,...
constraintfunction);

SIMULATION RESULT

For 100 generations

Population=double vector
scaling function=rank
crossover = scattered
selection function =stochastic

Best: -47.7332 Mean: -47.7325

-20
Fitness value

Best fitness
Mean fitness

-30

-40

Current best individual

-50

10

20

30

40

50
60
Generation
Current Best Individual

70

80

10

2
Number of variables (3)

R(1)=3.358, R(2)=6.708, R(3)=9.937

90

100

For 1000 generations

Population=double vector
scaling function=rank
crossover = scattered
selection function =stochastic

Best: -47.7413 Mean: -47.7411

-35
Fitness value

Best fitness
Mean fitness

-40

-45

Current best individual

-50

100

200

300

400
500
600
Generation
Current Best Individual

700

800

15

10

2
Number of variables (3)

R(1)=3.752, R(2)=5.972, R(3)=10.275

900

1000

For 10000 generations

Population=double vector
scaling function=rank
crossover = scattered
selection function =stochastic

Best: -47.7484 Mean: -47.748

-35
Fitness value

Best fitness
Mean fitness

-40

-45

Current best individual

-50

1000

2000

3000

4000 5000 6000 7000

Generation
Current Best Individual

8000

10

2
Number of variables (3)

R(1)=3.710, R(2)=6.434, R(3)=9.855

10

9000 10000

For 100 generation

Population=double vector
scaling function=top
crossover = arithmetic
selection function =uniform
Best: -47.7495 Mean: -47.7492
-35
Fitness value

Best fitness
Mean fitness

-40

-45

Current best individual

-50

10

20

30

40

50
60
Generation
Current Best Individual

70

80

15

10

2
Number of variables (3)

R(1)=3.672, R(2)=6.276, R(3)=10.053

11

90

100

For 1000 generations

Population=double vector
scaling function=top
crossover = arithmetic
selection function =uniform

Best: -47.7494 Mean: -47.7492

-35
Fitness value

Best fitness
Mean fitness

-40

-45

Current best individual

-50

100

200

300

400
500
600
Generation
Current Best Individual

700

800

15

10

2
Number of variables (3)

R(1)=3.704, R(2)=6.296, R(3)=10.00

12

900

1000

For 10000 generations

Population=double vector
scaling function=top
crossover = arithmetic
selection function =uniform

Best: -47.7292 Mean: -47.7291

-35
Fitness value

Best fitness
Mean fitness

-40

-45

Current best individual

-50

1000

2000

3000

4000 5000 6000 7000

Generation
Current Best Individual

8000

10

2
Number of variables (3)

R(1)=4.144, R(2)=6.11, R(3)=9.745

13

9000 10000

DISCUSSION OF RESULT
During the simulation, several parameters, i.e., selection, crossover,
scaling function and population size, need to be set. While experimenting on a
particular parameter, other parameters were kept constant to allow for
comparisons. It has been noted that the more the number of your iterations the
value tries to converge to a single value i.e we are getting the same result. For
any genetic algorithms, the settings of these parameters are generally ad hoc.
One general rule was kept throughout the simulation.

CONCLUS ION
In this report we used genetic algorithm to solve a co-channel
interference problem in which the cell radius is maximized. It is been noted that,
as the reuse distance or cell radius increases the interference decreases i.e. the
reuse distance is inversely proportional to the interference.

14

REFRENCES
[1] cellular network retrieved from https://en.wikipedia.org/wiki/
Cellular nework. March 2016.
[2]Dr. Ranjan B, the cellular concept, lecture 4 retrieved
www.m.youtube.com. March 2016.
[3] Jenna C, an introduction to genetic algorithm published on May
2006.
[4]interference retrieved from www.teletopix.org/gsm/what are
interference. March2016.

15