A RMS APPROACH FOR CHANNEL ALLOCATION UNDER HYBRID assigning the frequencies Electromagnetic Constraints considered.

There are three types MODE FOR MOBILE COMPUTING of the constraints
Dr.(col.) Rakesh Sharma*, Mr.Shahnawaz Husain*, Mr.Mukesh Chand Shahnawaz.husain@hotmail.com *Graphic Era Institute of Technology,Dehradun ABSTRACT:
As the future information technology is based on the wireless technology. There has been requirement for better approaches to maximize the utilization of the frequency band. 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 and Dynamic Channel Allocation 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. To maximize the advantage of the hybrid approach we propose NS algorithm. In this approach we proposed a fair allocation heuristic approach for FCA and 3C approach for DCA. 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. In 3C approach reduces the look ahead time and complexity for assigning the frequency in DCA under traffic load < 0.5.

are

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 simultaneously.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 performs well under light and moderated traffic provides flexibility 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] PROBLEM FORMULATION The cluster size has very important role for reducing the Co channel Interference[4]. After deciding the cluster size EMC 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 symmetric matrix, where N is the number of cells in the network. 1. Where each diagonal element Cij shows the CSC, i.e minimum separation in frequency between any two channels at cell i. 2. if Cij = 0 ; there is no constraint in channel reuse in between cell i & j. 3. if Cij = 1 ; there is a CCC 4. if Cij = 2; there is a ACC 5. if Cij >= 3; there is a CSC CM=

KEYWORDS: FCA, DCA, CCC, ACC, CSC, Demand Vector, Compatibility matrix, Fixed channel allocation service matrix,3C, CP, CB,TL. INTRODUCTION: 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 communication 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 maximum 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 channel assignment problem and is an active area of research .The channel assignment problem can be defined as assigning a minimum number of radio frequencies to the Base Stations without violating given constraints. For

Figure: Compatibility Matrix

The compatibility matrix has to be constructed with the extreme precision, so that it reflects the real network as closely as possible.[2,10,12] The compatibility matrix is therefore the most critical parameter for solving the FCA. But compatibility matrix is considered for assigning the Channel dynamically. For assigning the frequency on behalf of FCA, a Demand vector will be taken in to account, which is predetermined according to the demand of the cells. Dv = ( d1 d2 d3 -----------dN); Where di is the demand of channels by cell i PROPOSED NS ALGORITHM If(TL >= 0.5) { Assign with FCA; } Else { Assign with 3C; } Proposed Fair Allocation Algorithm(FCA): 1. start 2. initialize the CM & DV 3. FL :Lower Bound Frequency limit; FU : Upper Bound Frequency limit; M: No of Frequencies available; M= FU FL 4. Sort the demand vector in descending order DV; 5. Find out DVL /*Most Demanding cells value*/ 6. for (i=FL ; i<=FU ; i++) { for(j = DVL ; j<= 1; j--) { if (DV I = = j) { for( k = FL ; k < = i ; k++) { Assign conflict free channel to cell Ci ; } } if(DVi> j) { for( k = FL ; k < = i ; k++) { Assign conflict free channel to cell Ci ; } } Else { No Assignment; } }continue; } 7. stop

Proposed Algorithm for 3C approach : 1) Make a central pool for all available frequencies. 2) Assign the frequency to the cell according to its demand. 3) Before assigning the frequency to the cell it must consult the cell buffer(CB), which cell is using the frequency from the central pool (CP). 4) After checking the cell & frequency assigned to it go to the compatibility matrix for checking EM constraint. 5) Assign the conflict free frequency to the needed cell from the pool. 6) Refresh or delete the frequency entry in the cell buffer after the frequency is returned. 7) If cell Ci is not utilizing any frequency delete the cell entry from cell buffer(CB) 8) Cell Buffer will store only the cells using the frequency allocated from the central pool and the allocated frequencies to them. 9) For new demand by any cell; as stated in 4 cell buffer and EMC from CM has to be rechecked; the over head in DCA previous approaches has been reduced in our approach, as only the cells having the entry in cell buffer will be checked for Electro magnetic constraint in compatibility matrix before assigning the new frequency to another cell. Suppose cell 3 and 2 are in cell buffer and cell 1 is demanding, then it has to check only the corresponding entry ie C13 and C12 in Compatibility matrix there by reducing the look ahead time and complexity of assigning the channels to the cell. SIMULATION RESULT FOR FAIR CHANNEL ALLOCATION: Taking an example of CM & Dv is shown below:

C[10,12]

= 5 4 0 0 4 5 0 1
3) 1)

0 0 5 2

0 1 2 5

Dv = ( 1 1 Sorted Demand vector Dv= ( 3 2

2 1

Available frequencies M = 1 - 31;

Fixed channel allocation service matrix :

evolutionary optimization. IEEE Transactions on

Cell Assigned No Channels As Per Fair allocation Algo 1 2 3 4 1 2 3

Assigned Channels As Per Fair allocation Algo 1 2 3 4

Assigned Channels As Per Fair allocation Algo 1 2 3 4 1 9 1 0

Assigned Channels As Per Fair allocation Algo 1 2 3 4

Assigned Channels As Per Fair allocation Algo 1 2 3 4

Assigned Channels As Per Fair allocation Algo 1 1 4 2 21 3 4

1 6

22

CONCLUSION AND FURTHER DISCUSSION In this paper we give a fair allocation heuristic approach and 3C approach for 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(Under FCA where Traffic Load > 0.5). The 3C approach reduces the look ahead time and complexity for assigning the frequency in DCA under traffic load < 0.5. We have taken into account the Compatibility matrix and demand vector for the assignment of channels in Fair allocation service matrix and in 3C approach we have used central pool of frequencies and cell buffer check for assignment of new frequencies to the demanding cells and to reduce the look ahead time and complexity of assigning channels in DCA only corresponding entities of compatibility matrix are checked. Further discussion may consider for utilizing the frequency when both approaches are used simultaneously. REFERENCES:
[1] Dharma Prakash Agrawal and Qing- An Zeng, Introduction to Wireless and Mobile System University of Cincinnati. [2]. K.N.Sivarajan, R.J.McEliece and J.W.Ketchum, Channel assignment in cellular radio, in Proc. 39th IEEE Veh. Technology. Soc. Conf., pp. 846-850, May 1989. [3]. W.Wang and C.K Rushforth, An Adaptive Local-Search Algorithm 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.Kumar, S.Husain Deciding the Cluster Size on Behalf of Co-channel Interference Ratio for the Omni Directional Antenna in Mobile ComputingISTE day conference New Delhi Chapter 31st May & 1st June,08. [5] N. Funabiki and Y. Takefuji, A neural network parallel algorithm for channel assignment problems in cellular radio networks, IEEE Trans. Veh. Technol., vol. 41,no.4, pp. 430-437, Nov. 1992 [6]K.A Smith. A genetic algorithm for the channel assignment problem. IEEE Global Telecommunication Conference, GLOBECOM 1998, 420132018,1998. [7] Goutam Chakraborti- and Basabi Chakraborti-. genetic algorithm approach to solve channel assignment problem in cellular radio 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 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 GLOBECOM82; Pages 309-315, 1982. [12] A. I. Giortzis and L. F. Turner A mathematical Programming Approach to the Channel Allocation Problem in Radio Networks, IEEE,1996, 736-740