The rapid evolution of cellular technology and the more user demand for advanced mobile services leads the industry to develop more efficient network structures. The increasing number of cellular subscribers and the demand for cellular networks communication (3rd and 4th generation) drives to the research of the new methodologies for the design of cellular networks and services.This thesis has been generated and complied with the objective of proposing GSM Network Utilizing DYNAMIC CHANNEL ALLOCATION starting with the architecture of GSM Network with system design…
Contents
Chapter 1
1.1 Introduction
1.2 Objectives
1.3 Organization of Thesis
Chapter 2 Introduction to GSM
2.1 GSM
2.2 GSM Network Overview
2.3 Mobile Station
2.4 International Mobile Subscriber Identity
2.5 Temporary Mobile Subscriber Identity
2.6 Location Area Identity
2.7 MSISDN
2.8 Base Station Subsystem
2.9 Base Station Controller
2.10 Base Transceiver Station
2.11 Transcoder- XCDR
2.12 Network Switching System
2.13 Mobile Switching Centre
2.14 Home Location Register
2.15 Visitor Location Register
2.16 Equipment Identity Register (EIR)
2.17 Authentication Centre (AuC)
2.18 Interworking Function
2.19 Echo Canceller
2.20 Operation and Maintenance System
2.21 Network Management Centre
2.22 Operation and Maintenance
2.23 The Cell
2.24 Frequency Re-Use
2.25 Hands OFF
2.26 Hard Hand-OFF
2.27 Soft Hand-OFF
2.28 Interference
2.29 Co-Channel Interference
2.30 Adjacent Channel Interference
2.31 Improving Capacity Cellular in System
2.32 Cell Splitting
2.33 Sectoring
2.34 Microsoft Zone Concept
Chapter 3 Channel on the Air Interfere
3.1 Introduction
3.2 GSM Physical channels
3.3 GSM Logical Channels
3.4 Traffic Channels
3.5 Full Rate (TCH)
3.6 Half Rate (TCH)
3.7 Control Channels
3.8 Broadcast Control Channel
3.9 Frequency Control Channel
3.10 Synchronization Channel
3.11 Common Control Channel
3.12 Random Access Control Channel
3.13 Mapping of Logical Channels onto Physical Channels
3.14 Paging Channel (PCH)
3.15 Access Grant Control Channel
3.16 Cell Broadcast Channel
3.17 Dedicated Control Channel
3.18 Standalone Dedicated Control Channel
3.19 Associated Control Channel
3.20 Slow Associated Control Channel
3.21 Fast Associated Control Channel
3.22 Channel Combinations
3.23 Fast Rate Channel Combination
3.24 Channel Combination and Timeslots
Chapter 4 CHANNEL ALLOCATION SCHEME
4.1 Introduction
4.2 Type of Channel Assignment Strategies
4.3 Fixed Channel Allocation
4.4 Channel Borrowing
4.5 Flow Chart of FCA
4.6 Borrowing Schemes
4.7 Simple Borrowing (SB)
4.8 Borrow from the Richest
4.9 Basic Algorithm (BA)
4.10 Basic Algorithm with Reassignment (BAR)
4.11 Borrow First Available (BFA)
4.12 Advantages of FCA
4.13 Dynamic Channel Allocation
4.14 Centralized DCA
4.15 First Available Schemes
4.16 Locally Optimized Dynamic Assignment
4.17 Ring
4.18 Mean Square (MSQ)
4.19 1-Clique
4.20 Channel Reuse Optimization
4.21 Distributed DCA
4.22 Advantages of DCA
Chapter 5 DYNAMIC CHANNEL ALLOCATION ALGORITHM
5.1 Introduction
5.2 Interference in DCA
5.3 Issues of DCA
5.4 DCA Algorithm
5.5 FAIL Algorithm
5.6 Algorithm for Channel Re-Assignment
5.7 Algorithm for Sectored System
5.8 Traffic Case 1
5.9 Traffic Case 2
Chapter 6 TRAFFIC ENGINEERING
6.1 Trunking Theory
6.2 Type of Trunking System
6.3 Blocked Calls Cleared
6.4 Blocked Calls Delayed
6.5 Grade of Service
6.6 Traffic Analysis
6.7 Erlang B Table
6.8 Graph
Chapter 7
Conclusion and Future Work
REFERENCES
Author: Fayaz Ahmed Mahesar
Source: Blekinge Institute of Technology
Download URL 2: Visit Now