Frequency Assignment Problem in Cellular Networks Master Thesis Computer Engineering Muhammad Asif Noor Nr: E3875D 2010 DEGREE PROJECT Computer Engineering Programme Reg. number Extent Masters Programme in Computer Engineering - E3875D 15 ECTS Applied Artificial Intelligence Name of student Year-Month -Day Muhammad Asif Noor 2010-05-12 Supervisor Examiner Dr. Pascal Rebreyend Dr. Mark Dougherty Company/Department Department of Computer Engineering Title Frequency Assignment Problem in Cellular Networks Keywords Frequency Assignment, Cellular Network, Frequency Reuse, BTS , Heuristic, Simulated Annealing Algorithm , Greedy Algorithm . M.Asif Noor Degree Project E3875D May, 2010 Abstract: Cellular networks (GSM) need to assign the frequency (channels) for huge traffic in urban areas. Efficient Frequency assignment in cellular network is a most important task from last decade. Due to technical and legal issues, frequencies channel has to be assigned base station transceivers (BTS), so that the ratio of co-channel interference should be low. The information have been extracted from the open street map project and also representing the distribution of the population. Heuristics techniques are applied for assigning the frequencies and also reuse these frequencies in such way so that no adjacent or neighboring cells (BTS) share the same frequency. Proposed heuristics are simple to implement. The heuristic based algorithms have been developed to assign frequency (channels) efficiently. The proposed algorithms are Simulated Annealing and Greedy. After successfully assignment of frequencies, it is also be verified that frequency (channels) should be reused and try to minimize the co channels interference. The different scenarios have been tested using proposed algorithms. The proposed system gives the good results. The best performing heuristics might be integrated into a network planning system. This can be used in practice. Dalarna University Tel: +46 (0)23 778000 Röda vägen 3 Fax: +46 (0)23 778080 S-781 88 Borlänge http://www.du.se Sweden M.Asif Noor Degree Project E3875D May, 2010 I would like, Dedicated to My Beloved Parents Specially My beloved Father (Late) Noor Muhammad & I would like also dedicated to My Brothers and sister, Muhammad Saleem Anjum, Abdul Jabbar , Muhammad Ashfaq Noor, Abdul Razzaq , Muhammad Raiz Noor, Muhammad Arif Noor Dalarna University Tel: +46(0)23 7780000 Röda vägen 3S-781 88 Fax: +46(0)23 778080 Borlänge Sweden http://www.du.se - 3 - M.Asif Noor Degree Project E3875D May, 2010 ACKNOWLEDGMENT: This Master thesis was done in Department of Computer Engineering at Högskolan Dalarna between Feb2010 to May2010. First and foremost, I would like to thanks Mighty Allah who gives me strength and wisdom to fulfill the given task. Then I would like to say thanks my supervisor Dr. Pascal Rebreyend for his kind support and guidance. Through his guidance the work and time become very smooth at Högskolan Dalarna. He creates a wonderful and dynamic environment to learn in the field of cellular networks. For me he is a source of motivation. I would also like to thanks Professor Mark Dougherty for reviewing the report and kindly serving on the committee. I would like to express my gratitude to my beloved, Mother and very special my brothers for their love, support and encouragement in the pursuit of my career. Lastly, I would like also thank all of my friends with whom I spent good times during the stay in Borlänge. Dalarna University Tel: +46(0)23 7780000 Röda vägen 3S-781 88 Fax: +46(0)23 778080 Borlänge Sweden http://www.du.se - 4 - M.Asif Noor Degree Project E3875D May, 2010 Contents 1. Introduction: ................................................................................................................ - 9 - 1.1 Previous Research ................................................................................................... - 11 - 1.2 Problem definition .................................................................................................. - 12 - 1.3 Aim and Scope ........................................................................................................ - 12 - 2. CELLULAR NETWORK & SYSTEM DESIGN(BACKGROUND) .................. - 13 - 2.1 What is Cellular Networks (GSM)? ....................................................................... - 13 - 2.2 History of Cellular Networks (GSM) .................................................................... - 13 - 2.3 Cellular Networks (GSM) Architecture .................................................................... - 14 - 2.3.1 Mobile station ..................................................................................................... - 14 - 2.3.2 Base Station Subsystem (BSS) ........................................................................... - 15 - 2.3.3 Mobile switching centre (MSC) .......................................................................... - 16 - 2.3.4 Operation and Support Subsystem (OSS) ........................................................... - 16 - 2.4 Frequency Assignment Strategies in cellular networks ....................................... - 17 - 2.5 Frequency Reuse in Cellular Networks (GSM) .................................................... - 17 - 2.6 GSM Radio Subsystem Interface ........................................................................... - 19 - 2.7 Channel Structure in (GSM) Cellular Network ................................................... - 20 - 3. ALGORITHMS AND DESIGNING ........................................................................ - 21 - 3.1 Data preparation ...................................................................................................... - 24 - 3.2 Simulated Annealing Algorithm ............................................................................. - 25 - 3.3 Simulated Annealing Pseudo Code ........................................................................ - 26 - 3.4 Greedy Algorithm .................................................................................................... - 27 - 3.5 Greedy Pseudo Code ............................................................................................... - 28 - 4. IMPLANTATION DETAILS: .................................................................................. - 29 - 5. RESULTS AND ANALYSIS: ................................................................................... - 30 - 5.1 Comparison between Simulated Annealing&Greedy Algorithm with 300Polygons .................................................................................................................. - 30 - 5.1.1 Experiment-1 Simulated Annealing Algorithm with 300Polygons .................... - 30 - 5.1.2 Frequency (Channels) Reusability Using S.A. with 300 Polygons .................... - 32 - Dalarna University Tel: +46(0)23 7780000 Röda vägen 3S-781 88 Fax: +46(0)23 778080 Borlänge Sweden http://www.du.se - 5 - M.Asif Noor Degree Project E3875D May, 2010 5.1.3 Experiment-2 Greedy Algorithm with 300Polygons .......................................... - 33 - 5.1.4 Frequency (Channels) Reusability Using Greedy with 300 Polygons ................ - 34 - 5.1.5 Comparison ......................................................................................................... - 35 - 5.2 Comparison between Simulated Annealing&Greedy Algorithm with 500Polygons .................................................................................................................. - 36 - 5.2.1 Experiment-3 Simulated Annealing Algorithm with 500Polygons .................... - 36 - 5.2.2 Frequency (Channels) Reusability Using S.A. with 500 Polygons .................... - 38 - 5.2.3 Experiment-4 Greedy Algorithm with 500Polygons .......................................... - 38 - 5.2.4 Frequency (Channels) Reusability Using Greedy with 500 Polygons ................ - 40 - 5.2.5 Comparison ......................................................................................................... - 40 - 5.3 Comparison between Simulated Annealing&Greedy Algorithm with 1000Polygons ................................................................................................................ - 42 - 5.3.1Experiment-5 Simulated Annealing Algorithm with 1000Polygons: .................. - 42 - 5.3.2 Frequency (Channels) Reusability Using S.A. with 1000 Polygons: ................. - 44 - 5.3.3 Experiment-6 Greedy Algorithm with 1000Polygons: ....................................... - 44 - 5.3.4 Frequency (Channels) Reusability Using Greedy with 1000 Polygons:............. - 46 - 5.3.5 Comparison: ........................................................................................................ - 47 - 5.4 Final Comparison between S.A and Greedy of Frequency (Channels) Reusability .................................................................................................................... - 48 - 5.4.1Comparison: ......................................................................................................... - 49 - 5.5 Graphical Analysis of Frequency Assignment and Reuse: ............................... - 50 - 6. CONCLUSION AND FUTURE WORK: ................................................................ - 52 - 6.1 CONCLUSION ..................................................................................................... - 52 - 6.2 FUTURE WORK .................................................................................................. - 53 - 7. REFERENCES: ........................................................................................................