Term Project Presentation

on
Interference Mitigation Techniques in Cellular
System

Md Saif H2016124031
Mounesh H2016124024
Department of Electronics and Communication
BITS Pilani Hyderabad Campus

April 22, 2017 1

 MOTIVATION

Over the last few years, the number of cellular users and the popularity of mobile
computing have grown tremendously. This is mainly due to the different technological
advances that support mobile communications such as providing high-quality voice
communications and high-speed data services.

In order to minimize communication interference and to satisfy the large demand of

mobile telephone services, channels need to be assigned and reused. With minimum
interference possible.

Hence Interference management is very important for any cellular system to have better
GOS.

April 22, 2017 2

 OBJECTIVE

We are Using Genetic Algorithm(GA) as optimization method to assign the available

free channels to an incoming call in cell with as minimum interference as possible.GA
tool box in MATLAB is used. Fitness function is defined taking care of three
interference affects. This function will give channel with minimum interference.

April 22, 2017 3

 INTRODUCTION

The channel assignment problem is a complex problem where a minimum

number of channels have to be assigned, under several constraints, to the calls
requested in the cellular system.

There are three different channel assignment schemes.

1. Fixed channel assignment
2. Dynamic channel assignment
3. Hybrid channel assignment

We are using hybrid channel allocation scheme with GA to select the best
channel from the available pool of free channels

April 22, 2017 4

 Constraints to Channel Allocation

Three Interferences
1) Co-channel constraint (CCC)
where the same channel cannot be assigned to certain pairs of radio cells
simultaneously
2) Adjacent Channel contraint (ACC)
where channels adjacent in the frequency spectrum cannot be assigned to
adjacent radio cells simultaneously
3)Co-site constraint (CSC)
where channels assigned in the same radio cell must have a minimal
separation in frequency between each other.

April 22, 2017 5

 Genetic Algorithm

Genetic algorithm is search method based on natural biological evolution

process to find the global minima. In this algorithm at each generation a
new set of approximations is created by the process of selecting individual
based on fitness in the problem domain.

It consist of different stages

Initial population generation
Crossover
Mutation
Selection

April 22, 2017 6

 Population generation:
It includes defining parent chromosomes
Crossover:
This operation involves the swapping of genetic material between the two
parent strings. In this operation a bit position along the two chromosomes is
randomly chosen and exchanges the sub-sequences before and after that
position between two chromosomes to create two offspring
Mutation:
The offspring resulting from each crossover operation are mutated
to form the new generation. In the mutation operation one or more bits
from a randomly selected position of chromosome are altered or flipped

April 22, 2017 7

 Selection:
Chromosome is based on the survival-of-the fittest strategy. The fitness
function is used to rank the quality of a chromosome. A fitness value is
assigned to each chromosome by a fitness function and chromosome is
evaluated with this value for survival .

April 22, 2017 8

 GA FLOWCHART

April 22, 2017 9

 HCA USING GA

For performing dynamic channel assignment using genetic algorithm, the

DCA problem has to be formulated as an optimization problem first.
The proposed cellular topological model consists of total 24 cells and 12
channels .24 cells comprise of 6 clusters with 4 cells in each. The
simulation call traffic distribution can be either Uniform or Non Uniform
distribution. Uniform cellular traffic distribution indicates that every cell
has the same traffic load or demand. On the other hand, Non Uniform
cellular traffic distribution indicates that there is different traffic load in
each cell. In this simulation, Non Uniform traffic demands are considered.

April 22, 2017 10

 Proposed HCA GA Algorithm

System parameters like number of cells in the network and total number of
channels must be given as input to the genetic algorithm. The fitness function,
which determines the quality of each possible solution, must also be designed
and given as input to the algorithm. At the output, the best solution
corresponding to the channels that must be assigned to each cell is obtained.

April 22, 2017 11

 HCA USING GA FLOWCHART

April 22, 2017 12

 Representation:
A chromosome represents a cell from the cellular system to which a call is
referred, and a binary gene corresponds to a channel. The number of bits in
a chromosome is the number of channels that the cell may serve. If the
gene is 0, it means the channel is free and if it is 1, it means the channel is
occupied.

April 22, 2017 13

 Initial Population generation

The generation of the initial population for possible channel allocation

solutions is the initial stage of the GA algorithm. Two parent vectors
created in the initial population one for base stations as per the demand &
other for available channels.
BD = BT-BF
CD = CA-CF
BT: Total no of Base Stations
BF: Set of base station after allocation of channels,
BD: Set of base station requiring channel,
CA: Set of total available channels in the system,
CF : Set of allocated channels
CD: set of available channels

April 22, 2017 14

 Population Generation

April 22, 2017 15

In every generation of genetic algorithm from fittest chromosome channels are
allocated & BF, CF are updated to give new population.
Crossover
Crossover probability is to facilitate parent vector to take best characteristics
from each of parent. Single point position based crossover operator is proposed
to reduce the computational cost. Then the channel numbers and base station
numbers which are beyond the crossover point in both vectors are swapped,
and results in the child chromosome.
Mutation
Chromosomes which are selected to go for mutation as per the mutation
probability, base station numbers and channel numbers are swapped. It does
not affect the length of parent vector and does not produce any duplicate
base station & channel number.

April 22, 2017 16

 Typical Channel Assignment Problem[CAP]

Suppose the number of cells in the network is N = 4, there are M = 11 channels

available and the demand for the channels for each of these cells is given by
D = (1,1,1,3). Demand vector D defines the no of calls.
Consider the compatibility matrix C

April 22, 2017 17

 An interference-free assignment for a 4-cell and 11-channel network

April 22, 2017 18

 Solution Space [chromosome]

The solution space is represented by F as an N M binary matrix, where N is

the total number of radio cells and M is the total number of available channels

April 22, 2017 19

The cellular network is expected to meet the demand of the traffic and to avoid
interference. The first requirement imposes a demand constraint on F. Therefore, for
cell i , a total of di channels are required . This implies that the total number of ones in
row I of F must be di . If the assignment to cell i violates the demand constraint, then

The second requirement depends on the compatibility matrix C. It is made up of CSC,

CCC and ACC. In order to satisfy the CSC, if channel p is within distance Cii from an
already assigned channel q in cell i, then channel p must now not be assigned to cell i

April 22, 2017 20

 FITNESS FUNCTION

April 22, 2017 21

Each channel assignment in the network, represented by either a 1 or 0 in the F
solution matrix, represents the genes in each chromosome.

After randomly generating a population of chromosomes, the fitness of each

chromosome should be evaluated.

Therefore, all F solution arrays in the population are evaluated for their fitness
values, by using the final cost function.

The lower the cost function value, the fitter the chromosome.

The next step in the genetic algorithm is to generate a new population, using
genetic algorithm operators, such as selection, crossover and mutation.

April 22, 2017 22

The selection, crossover and mutation processes will be repeated until the new
population, which has the same size as the old population, is formed. After this
procedure, all new rows in the F solution matrix, or chromosomes, will be
used for a further run of the entire genetic algorithm until an optimized
solution is found.

April 22, 2017 23

 Graphs showing interference free assignment

D1= {1,1,1,3}. D2= {2,2,2,4,3}.

April 22, 2017 24

 Call Blocking in Cellular network

April 22, 2017 25

 Changing parameters in GA

April 22, 2017 26

 Solution Matrix

April 22, 2017 27

 Fitness Function Value

April 22, 2017 28

April 22, 2017 29
 DISCUSSION ON RESULTS

Using the HCA done with GA optimization result show that there is decrease
in no of call blocked.

Many parameters in GA also changed to get optimized solution like population

size ,number of iterations.

Changing the Population size . We can converge the fitness values with less
iterations.

Changing the mutation probability and crossover probability and different

combinations of Selection function from tool box optimized result can be
obtained.

April 22, 2017 30

 References
M. A. C. Lima, A. F. R. Araujo and A. C. Cesar, "Adaptive Genetic Algorithms for Dynamic
Channel Assignment in Mobile Cellular Communication Systems," in IEEE Transactions on
Vehicular Technology, vol. 56, no. 5, pp. 2685-2696, Sept. 2007.
A. Y. Zomaya and M. Wright, "Observations on using genetic-algorithms for channel
allocation in mobile computing," in IEEE Transactions on Parallel and Distributed Systems,
vol. 13, no. 9, pp. 948-962, Sep 2002.
D. K. Singh, K. Srinivas and D. Bhagwan, "A Dynamic Channel Assignment in GSM
Telecommunication network using Modified Genetic Algorithm," 2012 6th Euro American
Conference on Telematics and Information Systems (EATIS), Valencia, 2012, pp. 1-5.
Y. S. Chia, Z. W. Siew, A. Kiring, S. S. Yang and K. T. K. Teo, "Adaptive hybrid channel
assignment in wireless mobile network via genetic algorithm," 2011 11th International
Conference on Hybrid Intelligent Systems (HIS), Melacca, 2011, pp. 511-516
. I. Bogdan and G. Grigore, "Genetic algorithm based dynamic channel assignment for
cellular radio networks," Signals, Circuits and Systems, 2003. SCS 2003. International
Symposium on, 2003, pp. 529-532 vol.2.

April 22, 2017 31

 M. A. C. Lima, A. F. R. Araujo and A. C. Cesar, "Adaptive Genetic Algorithms for Dynamic
Channel Assignment in Mobile Cellular Communication Systems," in IEEE Transactions on
Vehicular Technology, vol. 56, no. 5, pp. 2685-2696, Sept. 2007.

April 22, 2017 32

April 22, 2017 33