Proceedings of the 3rd National Conference; INDIACo m-2009

Co mputing For Nation Development, February 26 27, 2009

Bharati Vidyapeeths Institute of Co mputer Applications and Management, New Delh i

A Fair Allocation Heuristic Approach For Fixed Channel Assignment Problem in

Mobile Computing
Dr.(Col.)Rakesh Sharma# , Shahnawaz Husain# , Mukesh Chand# Mohammad Ahmad Mansoori#,
Noor Mohammad#, Narendra Kumar*
# Graphic Era University, Dehradun.
*Dehradun Institute of Technology,Dehradun
shahnawaz.husain@hotmail.com

Abstract: channel assignment problem and is an active area of research

Due to insufficient frequency band and tremendous growth in
mobile users, the problem of channel assignment becomes very
important .Channel assignment is a fundamental task of
resource management that increases the capacity and quality
of services. As static channel allocation requires the heuristic
approach [2,3] to assign the channels to the cells, fixed
channel allocation works good under heavy traffic load as the
threshold of traffic grows beyond 0.5 & Dynamic channel
allocation scheme works under light and moderated traffic
when the threshold of traffic is less than 0.5. As per increasing
demand of mobile users & value added services we need to
implement the Fixed Channel Assignment to provide the better
services to the users, Being an NP-complete problem [10, 11],
finding good quality solutions for FCA is very difficult to
achieve. Suppose we have M channels to assign N Cells then
total possible combination will M CN & it is not necessary that
all solutions give the optimized result. In this paper we give a
fair allocation heuristic approach to assigning the conflict free
channels to the all cells, our results are able to match lower
bound conditions & find the results in such a way that no cell
will starve for conflict free channels.
Keywords:
FCA, DCA, CCC, ACC, CSC, Demand Vector, Co mpatib ility
matrix, Fixed channel allocation service mat rix.
.The channel assignment problem can be defined as assigning a
minimu m number of radio frequencies to the Base Stations
without violating given constraints. For assigning the
frequencies Electro magnetic Constraints are considered. There
are three types of the constraints namely1) The Co-channel
Constraint (CCC), where the same channel cannot be assigned
to certain pair of radio cells simultaneously.2) The Adjacent
Channel Constraint (ACC), frequencies adjacent in the
frequency domain cannot be assigned to adjacent cell
simu ltaneously.3) The Cosite Constraint (CSC), [12] any pair
of channels assigned to a radio cell must occupy a certain
distance in the frequency domain.
The channel assignment problem can be classified as 1) Fixed
Channel Assignment (FCA), channels are permanently
allocated to the cells according to their predetermined demand
in the fixed problem, it is difficult to adapt to any changes in
either channel demand or any interference constraint.2)
Dynamic Channel Assignment (DCA), where all channels are
stored within a pool and allocated dynamically as per demand,
which includes heavy computation[11]. DCA perfor ms well
under light and moderated traffic provides flexib ility during
assigning the channels at the cost of higher complexity & fails
under heavy traffic but for heavy traffic load FCA performs
good.3) Hybrid Channel Allocation (HCA ) provides the facility
of both FCA & DCA.[1]

1. Introducti on: 2. Problem Formulation:

Efficient spectrum resource management is important due to
increasing demand of new services, rapid & unbalanced growth
of radio traffic and other factors. A given radio spectrum
dedicated for mobile co mmunication can be divided into a set
of disjoint and non interfering radio channels. We can use one
of the technique frequency, time, and code division to divide
the frequency spectrum.
Since the radio spectrum is finite, cells have to use these
channels as efficiently as possible. To cover the whole
geographical location, clustering technique [1] is used. To
reduce the co-channel interference cluster size plays an
important role [4]. To serve the maximu m user, frequency
reuse concept is used. With a limited frequency spectrum
available, the main task of cell design is to optimize the use of
the available frequency bandwidth. This is known as the
The cluster size has very important role for reducing the
Cochannel Interference[4]. After deciding the cluster size EM C
should be considered for getting the peak performance and all
three constraints can be represented with the help of
compatibility matrix (CM) which is NxN sy mmetric matrix,
where N is the number of cells in the network.
CM = C11 C12 --------------------- C1N
C21 C22 ---------------------- C2N
CN1 CN2 ---------------------- CNN
 Proceedings of the 3rd National Conference; INDIACo m-2009

else
1. Where each diagonal element Cij shows the CSC, i.e {
minimu m separation in frequency between any two No Assignment;
channels at cell i. }
2. if Cij = 0 ; there is no constraint in channel reuse in
between cell i & j. 9. }continue;
3. if Cij = 1 ; there is a CCC 10. }
4. if Cij = 2; there is a ACC 11. Stop.
5.if Cij >= 3; there is a CSC
The compatibility matrix has to be constructed with the 4. Simulation Result:
extreme precision, so that it reflects the real network as closely Taking an example of CM & Dv is shown below;
as possible.[2,10,12]
The compatibility matrix is therefore the most critical C[10,12] = 5 4 0 0
parameter fo r solving the FCA. But compatibility matrix is 4 5 0 1
considered for assigning the Channel dynamically. For 0 0 5 2
assigning the frequency on behalf of FCA, a Demand vector 0 1 2 5
will be taken in to account, which is predetermined according
to the demand of the cells.

Dv = ( d 1 d 2 d 3 -----------d N ); Dv = ( 1 1 2
Where d i is the demand of channels by cell i 3 )

Sorted Demand vector

3. Proposed Fair All ocation Algorithm: Dv = ( 3 2 1
1 )
1. start
2. initialize the CM & DV Available frequencies M = 1 - 31;
3. FL :Lower Bound Frequency limit;
FU : Upper Bound Frequency limit; Fi xed channel allocation service matrix:
M: No of Frequencies available; Cell Assigned Assigned Assigned
M= FU - FL No Channels As Channels As Channels As Per
4. Sort the demand vector in descending order Per Fair Per Fair Fair allocation
DV; allocation allocation Algo
5. Find out DVL Algo Algo
/*Most Demanding cells value*/ 1 2 3 4 1 2 3 4 1 2 3 4
6. for (i=FL ; i<=FU ; i++) 1 1
7. { 2 9
for(j = DVL ; j<= 1; j--) 3 4 10
8. { 4 1 7 13
if (DV I = = j) Cell Channels As Assigned Assigned
{ No Per Fair Channels As Channels As Per
for( k = FL ; k < = i ; k++) allocation Per Fair Fair allocation
{ Algo allocation Algo
Assign conflict free Algo
channel to cell Ci ; 1 2 3 4 1 2 3 4 1 2 3 4
} 1 14
}
2 21
if(DVi > j)
3 16 22
{
4 19 25 31
for( k = FL ; k < = i ; k++)
{
This technique is used to assign the channels to the cells
Assign conflict free
channel to cell Ci ; because if frequencies are less in number& we assign the
frequencies to the highest priority cells first completely, then
}
remain ing cells may starved for conflict free channels.
} Total assigned frequencies = 14
A Fair Allocation Heuristic Approach For Fixed Channel Assignment Problem in Mobile Co mputing

Unused frequencies = 19
(2,3,5,6,8,11,12,15,17,18,20,21,23,24,26,27,28,29,30).
i.e unused frequencies are just equal to assigned frequencies in
number.

5. Conclusion & Further Discussion:

In this paper a Fair Allocation Heuristic approach is used for
assigning the channels in static way .The idea is given for fairly
allocation of channels in FCA in such a way that no cell will
starve for conflict free channels and we have taken into account
the Compatibility matrix and demand vector for the assignment
of channels. Further discussion may consider for utilizing the
unused frequencies.

6. References:
[1] Dharma Prakash Agrawal and Qing- An Zeng,
Introduction to Wireless and Mobile System Un iversity
of Cincinnati.
[2]. K.N.Sivarajan, R.J.McEliece and J.W.Ketchum, Channel
th
assignment in cellular radio, in Proc. 39 IEEE Veh.
Technology. Soc. Conf., pp. 846-850, May 1989.
[3]. W.Wang and C.K Rushforth, An Adaptive Local-Search
Algorith m for the Channel-Assignment Problem (CAP),
IEEE Trans on Veh Technology, vol 45, pp. 459 -446,
August 1996.
[4] M.Q.Rafiq, M.Chauhan, S.Ku mar, S.Husain Deciding the
Cluster Size on Behalf of Co -channel Interference Ratio
for the Omn i Direct ional Antenna in Mobile
Co mputingISTE day conference New Delhi Chapter 31st
May & 1st June,08.
[5] N. Funabiki and Y. Takefuji, A neural network parallel
algorith m for channel assignment problems in cellu lar
radio networks, IEEE Trans. Veh. Technol., vol. 41,no.4,
pp. 430-437, Nov. 1992
[6] K.A Smith. A genetic algorith m for the channel
assignment problem. IEEE Global Telecommunication
Conference, GLOBEC OM 1998, 42013-2018,1998.
[7] Goutam Chakraborti- and Basabi Chakrabort i-. genetic
algorith m approach to solve channel assignment problem
in cellular rad io networks. 1999
[8] IEEE Midnight-Sun Workshop on, Soft Computing
Methods in Industrial Applications. pages 34-39.June
1999.
[9] W.K. Lai and George G. Coghill. Channel assignment
through evolutionary optimization. IEEE Transactions on
Vehicular Technology, 45( 1):91-96.February 1996.
[10] Junaid A. Khan Sadiq M. Suit Sulman A. Khan a fast
constructive algorithm for fixed channel assignment
problem,IEEE Proceeding,2001 ,V65-V68.
[11] A. Gamst and W. Rave. On frequency assignment in
mobile automatic telephone systems. 172 Proceedings of
IEEE GLOBEC OM82; Pages 309-315, 1982.
[12] A. I. Giort zis and L. F. Turner A mathematical
Programming Approach to the Channel Allocation
Problem in Radio Networks, IEEE,1996, 736-740