1.

INTRODUCTION

1.1 Background
One main issue in cellular system design reduces to one of economics. Essentially we have a limited resource transmission spectrum, which must be shared by several users. Unlike wired communications which benefits from isolation provided by cables, wireless users within close proximity of one another can cause significant interference to one another? To address this issue, the concept of cellular communications was introduced around in 1968 by researchers at AT&T Bell Labs. The basic concept being that a given geography is divided into polygons called cells [2].

Fig .1 Cellular network model

Cell is allocated a portion of the total frequency spectrum, which is channel [1]. A channel is a communication medium, the path that data takes from source to destination. A channel can be comprised of so many different things: wires, free space, and entire networks. Signals can be routed from one type of network to another network with completely different characteristics. In the Internet, a packet may be sent over a wireless

Wi-Fi network to an Ethernet Lan, to a DSL modem, to a fibre-optic backbone, etc. The many unique physical characteristics of different channels determine the three characteristics of interest in communication: the latency, the data rate, and the reliability of the channel. If channel is considered as the highway, then the bandwidth is like the number of lane in the high way. More lanes mean more traffic at a time and high speed transportation. Bandwidth also refers to as grade, tells us the rate, or speed at which data can be transmitted over the channel. There are three brands for communication channel:

Narrow Band Channel-Narrow band channel or the low speed channel is the slowest band, transmits the data from 40 bit per second to 1200 bits per seconds. Telegraph lines are the example of narrow band channel. Voice Band Channel-Voice band channel or the medium speed channel is faster than narrow band channel, and transmit data from 110 bits per second to 9600 bits per second. Telephone lines are the example of voice band channel.

Broad Band Channel-Broad band channel or the high speed channel is the fastest channel which transmits data up to several million bits per second and in special cases, goes up to billions of bits per seconds. Coaxial cable, fibre optics, and Microwave are the examples of broadband channels. The "capacity" of a channel is the theoretical upper-limit to the bit rate over a given channel that will result in negligible errors. Channel capacity is measured in bits/s. Shannon's channel capacity is an equation that determines the information capacity of a channel from a few physical characteristics of the channel. Channel allocation deals with the allocation of channels to cells in a cellular network. Once the channels are allocated, cells may then allow users within the cell to communicate

via the available channels. Channels in a wireless communication system typically consist of time slots, frequency bands and/or CDMA pseudo noise sequences, but in an abstract sense, they can represent any generic transmission resource. Common Principles of Channel Allocation Schemes: The large array of possible channel allocation systems can become cumbersome. However, all channel allocation methods operate under simple, common principles. Throughout this report we have touched on three points which an efficient channel allocation scheme should address: 1. Channel allocation schemes must not violate minimum frequency reuse conditions. 2. Channel allocation schemes should adapt to changing traffic conditions. 3. Channel allocation schemes should approach (from above) the minimum frequency reuse constraints so as to efficiently utilize available transmission resources. Each mobile service station (MSS) is assigned a contiguous range of channel not overlapping with those of its neighbours. Channel boundaries between adjacent MSSs are dynamically adjustable through voluntary withdrawals. High efficiency is provided by two important features: early boundary expansion and need-based boundary redrawing [10]. Environment consists of assigning channels to the radio interfaces in order to achieve efficient channel utilization and minimize interference. The problem of optimally assigning channels in an arbitrary mesh topology has been proven to be NP-hard based on its mapping to a graph-colouring problem [6] & [7]. Therefore, channel assignment schemes predominantly employ heuristic techniques to assign channels to nodes in the network. There are three major categories for assigning these channels to cells (or base-stations). They are

Fixed Channel Allocation, Dynamic Channel Allocation and Hybrid Channel Allocation which is a combination of the first two methods.

In FCA, according to predetermined traffic demand and co-channel interference constraints, a fixed number of channels are assigned to each cell. [1] FCA is very simple

but this scheme is difficult to survive in changing traffic conditions and user distributions. Over the whole service area if traffic varies from cell to cell, FCA could not attain a high efficiency of total channel usage. DCA strategy has been proposed, in order to overcome the problems of FCA. In DCA, channels are not allocated to cells permanently [1]. For every call request base station request channels from MSC. According to the duration of the calls, channels are assigned temporarily for use in cells. The channel is returned back and kept in the central pool, after the cal is over. In order to avoid co-channel interference, any channel that in use in one cell can only be reassigned to another cell simultaneously if the distance between those two cells is larger than the minimum reuse distance. DCA needs many transceivers for each base station. Behave well in low load but behave worse than FCA in heavy load. HCA strategy has been proposed, in order to overcome the problems of DCA. DCA schemes are suggested for TDMA/FDMA based cellular systems such as GSM, but are currently not used in any products. HCA, The third category of channel allocation is hybrid channel allocation; it is hybrid of fixed and dynamic channel allocation algorithm [2]. Channels in HCA are divided into two disjoint sets

First is fixed set: set of channel which is assigned to each cell on FCA basis. Second is dynamic set: set which are kept in a central pool of MSC for dynamic assignment.

Fixed set channels are preferred for use in their respective cells, which are assigned to cells as in the FCA schemes. When a mobile user demands for a channel for its call, channel is assigned from fixed set, but when all the channels in its fixed set are busy, only then a request is made from dynamic set of central pool. The ratio of the fixed channels and dynamic channels plays a vital role in channel allocation scheme, if the ratio is 50% or more, than FCA performs better than HCA as in [1].

1.2 Motivation
The motivation behind this project is to decrease the call drop rate in wireless mobile communication systems; since the available frequency spectrum is limited the channels must be reused as much as possible in order to increase the system capacity. This

requires a proper channel allocation scheme. Channel allocation becomes complicated, when more than one cell become hot-spot. The term hot-spot means the bandwidth resources currently available in those cells are not sufficient to sustain any more call [3]. In this thesis, we present a novel Hybrid channel allocation scheme in which MSC will fetch those ideal channels, which are borrowed to requesting cell from the central pool in the time of hot spot and become ideal for some period of time. MSC make use of these channels in order to sustain new incoming call. 1.3 Thesis Objective In this thesis, we have concentrated on the issues of decreasing call drops in wireless communication system. The aim of undertaken work in this thesis includes: a) Study of various channel allocation scheme and their performance.

b) Implementation of hybrid channel allocation with hot-spot notification.

c) Performance evaluation of the proposed scheme using various results under call drop rate, call block rate, handover and system load.

d) Comparison of proposed method with the existing hybrid channel allocation scheme. 1.4 Thesis Outline The thesis is organised as follows: The thesis is organized as follows: chapter 2 contains literature survey of various channel allocation technique and topics related to problem domain. The approaches used by different researchers differ in the type of channel allocation. Chapter 3 covers background theory which includes description of all the channel allocation technique, comparison between them, and hot-spot condition. In Chapter 4, the proposed method for decreasing call drop rate in hybrid channel allocation with hot-spot notification in detail. Chapter 5 includes implementation of our proposed system. Chapter 6 presents the experimental results for hybrid channel allocation with proposed techniques. Finally chapter 7 includes the conclusion and future scope.

2. LITERATURE REVIEW

The radio spectrum allocated to wireless cellular mobile communication system is fixed one. Efficient use of available spectrum will produce an increased number of users [4]. The fundamental operational principle of wireless cellular mobile communication system is the reuse of frequencies at different places within the areas of service. The channel allocation strategy is the technique used to make the most efficient and intelligent way of utilizing the available radio spectrum by the way in which channels are allocated to mobile multimedia calls. The channel allocation strategy is the soul of all portable communication systems. It affects not only the quality and availability of connections but also the traffic distribution which, in turn, affects the capacity of the system. The work presented in this thesis is focused on optimal hybrid channel allocation algorithm with hot-spot to decrease the call drop rate. In this chapter, Vigorous research has been pursued in channel allocation technique for a number of years. In the area of channel allocation different techniques have been used and still the area is being explored. In this section we review some of the papers on channel allocation techniques. The outline of the chapter is as follows: In section 2.1 we review the comparison between different channel allocation schemes. Section 2.2 covers code channel assignment. Channel assignment with different algorithm is presented in section 2.3. Hybrid channel allocation is proposed in section 2.4. Section 2.5 explores the hybrid channel allocation algorithm using hot-spot technique. In section 2.6 Game theoretical approaches for channel allocation is proposed. Performance of different channel allocation schemes is covered in section 2.7. 2.1. Comparison between different Channel allocation schemes In 1996, Chi Chung Lam, presents [21] a distributed channel allocation algorithm based on the concept of dynamic channel boundaries. Under this scheme, each mobile service station (MSS) is assigned a contiguous range of channel not overlapping with those of its neighbours. Channel boundaries between adjacent MSSs are dynamically adjustable through voluntary withdrawals. High efficiency is provided by two important features: early boundary expansion and need-based boundary redrawing. This algorithm imposes a low message volume on the fixed network, has short response times to connection requests

and achieves high channel utilization under both evenly and unevenly distributed loads. Channel utilization is further improved if a MSS may borrow channels from its neighbours. In 1997, Zukerman, M. provides [22] simple models for efficiency evaluation of various channel allocation schemes in digital mobile telecommunications networks. The analysis is based on known queuing network results and standard Markovian queuing models. Queues can be chained to form queuing networks where the departures from one queue enter the next queue. Queuing networks can be: open & closed. Open queuing networks have an external input and an external final destination. Closed queuing networks are completely contained and the customers circulate continually never leaving the network. 2.2. Code channel assignment In 2003, Hasan Cam, proposed [14] a Non blocking OVSF Codes and Enhancing Network Capacity for 3G Wireless and Beyond Systems in which he explained orthogonal variable spreading factor (OVSF) codes which are employed as channelization codes in WCDMA. Any two OVSF codes are orthogonal if and only if one of them is not a parent code of the other. Therefore, when an OVSF code is assigned, it blocks its entire ancestor and descendant codes from assignment because they are not orthogonal to each other. Unfortunately, this code blocking problem of OVSF codes can cause a substantial spectral efficiency loss of up to 25%. This paper presents non blocking OVSF (NOVSF) codes to increase substantially the utilization of channelization codes without having the overhead of code reassignments.

Fig.2.1 OVSF Code Tree

2.3 Channel assignment using different algorithm In 2005, Wei Wang and Xin Liu proposed [17], a List-colouring Based Channel Allocation for Open-Spectrum Wireless Networks, in this paper he studied the dynamics in the available channels caused by the location and traffic load of the primary users and proposed several distributed algorithms to exploit the available channels for secondary users. The performance of different algorithms is evaluated in networks with static and time-varying channel availability.

Fig.2.2 A Colour Graph In 2006, Jun Sun develop a novel auction-based algorithm [20] to allow users to fairly compete for a wireless fading channel. We use the second-price auction mechanism whereby user bids for the channel, during each time slot, based on the fade state of the channel, and the user that makes the highest bid wins use of the channel by paying the second highest bid. Under the assumption that each user has a limited budget for bidding, we show the existence of a Nash equilibrium strategy, and the Nash equilibrium leads to a unique allocation for certain channel state distribution, such as the exponential distribution and the uniform distribution Based on the Nash equilibrium strategies of the second-price auction with money constraint, he further propose a centralized opportunistic scheduler that does not suffer the shortcomings associated with the proportional fair scheduler. 2.4 Hybrid channel allocation algorithm In 2005, Geetali Vidyarthi proposed an algorithm for Hybrid Channel Assignment Approach Using an Efficient Evolutionary Strategy [16]. In this paper; she had developed an evolutionary strategy (ES) which optimizes the channel assignment. The proposed ES

approach uses an efficient problem representation as well as an appropriate fitness function. This paper deals with a novel hybrid channel assignment based scheme called Dring. D-ring method yields a faster running time and simpler objective function. she also proposed a novel way of generating the initial population which reduces the number of channels reassignments and therefore yields a faster running time and may generate a possibly better initial parent. The basic steps of an ES algorithm can be summarized as follows. 1) Generate an initial population of individuals. 2) Evaluate each individual according to a fitness function. 3) Select best individuals called the parent population and discard the rest. 4) Apply genetic operator to create off springs from parents. 5) Go to step 2 until a desired solution has been found or predetermined number generations have been produced and evaluated. 2.5 Hybrid channel allocation using hot-spot technique In 2006, Rana Ejaz Ahmed proposed [2] a hybrid channel allocation algorithm using hotspot notification. This paper presents a new hybrid channel allocation algorithm in which the base station sends a multi-level hotspot notification to the central pool located at Mobile Switching Station (MSC) on each channel request that cannot be satisfied locally at the base station. This notification will request more than one channel be assigned to the requesting cell, proportional to the current hot-spot level of the cell. When a call using such a borrowed channel terminates, the cell may retain the channel depending upon its current hot-spot level. The simulation study of the protocol indicates that the protocol has low overhead, and it behaves similar to the Fixed Channel Allocation (FCA) scheme at high traffic and to the Dynamic Channel Allocation (DCA) scheme at low traffic loads. The proposed algorithm also offers low-overhead in terms of the number of control messages exchanged between a base station and the MSC on channel acquisition and release phases.

In 2008, Yuhong Zhang and Ezzatollah Salari investigated and proposed [23] a novel analytical model of a hybrid channel allocation algorithm in which each cell of the network consists of a predefined fixed number of channels and the network may approve

the request for extra channel for both new and handoff calls if all predesigned channel are occupied. This approval depends on the type of new and handoff calls, as well as the number of approved channels in the cell. If the request id denied for an arriving new call, this call will not be blocked immediately but rather put on hold in buffer with finite space. The implication behind this is to give priority to hand off calls. In 2010, Joshi, J. proposed [13] a hybrid channel allocation algorithm to reduce call blocking probability using hot-spot notification. In this paper attempts are made to reduce call-blocking probability by designing hybrid channel allocation (HCA) which is the combination of fixed channel allocation (FCA) and dynamic channel allocation (DCA). A cell becomes hot-spot when the bandwidth available in that cell is not enough to sustain the users demand and call will be blocked or dropped. A simulation result shows that HCA scheme significantly reduces call-blocking probability in hotspot scenario and compared with cold-spot cell. This hot-spot notification will request more than one channel be assigned to the requesting cell, proportional to the current hot-spot level of the cell. Furthermore, all channels will be placed in a central pool and on demand will be assigned to the base station. That will be helpful to reduce call-blocking probability when cell becomes hot-spot. When a call using such a borrowed channel terminates, the cell may retain the channel depending upon its current hot-spot level therefore HCA has comparatively much smaller number of reallocations than other schemes. It also shows that it behaves similar to the FCA at high traffic and to the DCA at low traffic loads as it is designed to meet the advantages of both. 2.6 Game theoretical approach for channel allocation In 2011, Jiming Chen proposed [5] a Game Theoretical Approach for Channel Allocation in Wireless Sensor and Actuator Networks, in which multi-channel allocation in wireless sensor and actuator networks is formulated as an optimization problem which is NP-hard. In order to efficiently solve this problem, a distributed game based channel allocation (GBCA) Algorithm is proposed by taking into account both network topology and routing information. For both tree/forest routing and non-tree/forest routing scenarios, it is proved that there exists at least one Nash Equilibrium for the problem. Furthermore, the sub optimality of Nash Equilibrium and the convergence of the Best Response dynamics are also analyzed. Simulation results demonstrate that GBCA significantly reduces the

10

interference and dramatically improves the network performance in terms of delivery ratio, throughput, channel access delay, and energy consumption. Main contribution of this paper is1. Analyze the relationship between the numbers of links and define interference metric. 2. For the tree/forest routing, we show that the game is an exact potential game and there exists at least one NE in the game. 3. We introduce several virtual nodes and add interfering links for each crossing node to facilitate the construction of parent-children sets in general routing. 4. In order to solve the channel allocation problem in a suboptimal way but in polynomial time, we propose a distributed algorithm, GBCA. 2.7 Performance of different channel allocation schemes. In 2012, M.L.S.N.S. Lakshmi proposed [1] an insight to call blocking probabilities of channel assignment schemes In this paper, the performance of three different channel allocation schemes FCA, DCA and HCA will be analytically compared and the results are presented. Different channel allocation schemes are in use for mobile communication systems, of which the Hybrid channel allocation (HCA) a combination of Fixed and Dynamic channel allocation schemes (FCA and DCA respectively) was effective by the experimental and simulated evaluations of all channel assignment schemes we proposed that HCA will give the appropriate results in reducing call blocking probability. The main advantage of this algorithm is that it can adapt to dynamic strategy at low traffic load and to fixed strategy at higher traffic intensity load and to fixed strategy at higher traffic intensity. If we increase the value of hot-spot level (L), the system performance in both regions of the low and high traffic intensity. From the above discussion it can be deemed that hybrid channel allocation algorithm sends a multi-level hot-spot notification to the central pool on each channel request which cannot be satisfied locally at the base station. This notification will request more than one channel be assigned to the requesting cell, proportional to the current hot-spot level (L) of the cell. This also reduce control message overhead needed to acquire each channels individually.

11

3. BACKGROUND THEORY

3.1 COMMUNICATION CHANNELS

3.1.1. Introduction
In telecommunications and computer networking, a communication channel, or channel, refers either to a physical transmission medium such as a wire, or to a logical connection over a multiplexed medium such as a radio channel. A channel is used to convey an information signal, for example a digital bit stream, from one or several senders (or transmitters) to one or several receivers. A channel has a certain capacity for transmitting information, often measured by its bandwidth in Hz or its data rate in bits per second. Communicating data from one location to another requires some form of pathway or medium. These pathways, called communication channels, use two types of media: cable (twisted-pair wire, cable, and fibre-optic cable) and broadcast (microwave, satellite, radio, and infrared). Cable or wire line media use physical wires of cables to transmit data and information. Twisted-pair wire and coaxial cables are made of copper, and fibre-optic cable is made of glass. In the Internet, a packet may be sent over a wireless Wi-Fi network to an Ethernet Lan, to a DSL modem, to a fibre-optic backbone, etc. The many unique physical characteristics of different channels determine the three characteristics of interest in communication: the latency, the data rate, and the reliability of the channel. If channel is considered as the highway, then the bandwidth is like the number of lane in the high way. More lanes mean more traffic at a time and high speed transportation. Bandwidth also refers to as grade, tells us the rate, or speed at which data can be transmitted over the channel. 3.1.2 There are three bands for communication channel:

1. Narrow Band Channel-Narrow band channel or the low speed channel is the slowest band, transmits the data from 40 bit per second to 1200 bits per seconds. Telegraph lines are the example of narrow band channel.

12

2. Voice Band Channel-Voice band channel or the medium speed channel is faster than narrow band channel, and transmit data from 110 bits per second to 9600 bits per second. Telephone lines are the example of voice band channel.

3. Broad Band Channel-Broad band channel or the high speed channel is the fastest channel which transmits data up to several million bits per second and in special cases, goes up to billions of bits per seconds. Coaxial cable, fiber optics, and Microwave are the examples of broadband channels. The "capacity" of a channel is the theoretical upper-limit to the bit rate over a given channel that will result in negligible errors. Channel capacity is measured in bits/s. Shannon's channel capacity is an equation that determines the information capacity of a channel from a few physical characteristics of the channel.

3.1.3 How channels are form Multiplexing describes how several users can share a medium with minimum or no interference. For wireless communication, multiplexing can be carried out in four dimensions [10]: space (s) time (t) frequency (f) code (c)

In this field, the task of multiplexing is to assign space, time, frequency, and code to each communication channel with a minimum of interference and a maximum of medium utilization. The term communication channel here only refers to an association of sender(s) and receiver(s) who want to exchange data.

13

1. Space division multiplexing: In wireless transmission, SDM implies a separate sender for each communication channel with a wide enough distance between the senders [10]. This multiplexing is used, for example, at FM radio stations where the transmission range is limited to a certain region. Here space is represented via circles indicating the interference range. The channel k1 to k3 can be mapped onto the three spaces s1 to s3 which clearly separate the channel and prevent the interference range from overlapping.

fig.3.1 Space Division Multiplexing

2. Frequency division multiplexing Separation of the whole spectrum into smaller frequency bands channel gets a certain band of the spectrum for the whole time [10]. Each channel k, is now allocated its own frequency band as indicated senders using a certain frequency band can use this band continuously. Advantages: no dynamic coordination necessary, works also for analog signals. Disadvantages: waste of bandwidth if the traffic is distributed unevenly inflexible guard spaces

14

Fig. 3.2 Frequency Division Multiplexing

3. Time division multiplexing: A more flexible multiplexing scheme for typical mobile communication is time division multiplexing (TDM) [10]. Here a channel k1 is given the whole bandwidth for a certain amount of time, i.e., all senders use the same frequency but at different point of time. Advantages: only one carrier in the medium at any time, throughput high even for many users. Disadvantages: precise synchronization necessary.

Fig. 3.3 Time Division Multiplexing

15

4. Frequency and time multiplexing: Combination of both methods: A channel gets a certain frequency band for a certain amount of time [10]. Example: GSM Advantages: Better protection against tapping, protection against frequency selective interference & higher data rates compared to code multiplex. but: precise coordination required.

Fig. 3.4 Frequency and Time division multiplexing combined 5. Code division multiplexing Code division multiplexing is a relatively new scheme in commercial communication systems [10].fig 3.5 shows all channels k1 use the same frequency at the same time for transmission. Separation is now achieved by assigning each channel its own code, guard spaces are realized by using codes with the necessary distance in code space, e.g., orthogonal codes.

Fig.3.5 Code Division Multiplexing

16

3.2 Channel Allocation

3.2.1 Introduction A given radio spectrum (or bandwidth) can be divided into a set of disjoint or non interfering radio channels [19]. All such channels can be used simultaneously while maintaining an acceptable received radio signal. In order to divide a given radio spectrum into such channels many techniques such as frequency division (FD), time division (TD), or code division (CD) can be used. In FD, the spectrum is divided into disjoint frequency bands, whereas in TD the channel separation is achieved by dividing the usage of the channel into disjoint time periods called time slots. In CD, the channel separation is achieved by using different modulation codes. Furthermore, more elaborate techniques can be designed to divide a radio spectrum into a set of disjoint channels based on combining the above techniques. For example, a combination of TD and FD can be used by dividing each frequency band of an FD scheme into time slots. The major driving factor in determining the number of channels with certain quality that can be used for a given wireless spectrum is the level of received signal quality that can be achieved in each channel. The distance between two cells is defined as the Euclidean distance between the centres of the two cells. Let Si(k) be denoted as the set ( i ) of wireless terminals that communicate with each other using the same channel k. By taking advantage of physical characteristics of the radio environment, the same channel k can be reused simultaneously by another set j if the members of sets i and j are spaced sufficiently apart. All such sets which use the same channel are referred to as co-channel sets or simply co-channels. The minimum distance at which co-channels can be reused with acceptable interference is called the "co-channel reuse distance, as shown in [19]. This is possible because due to propagation path loss in the radio environment, the average power received from a transmitter at distance d is proportional to PT d a, where a is a number in the range of 3-5 depending on the physical environment, and PT is the average transmitter power. For example, for an indoor environment with a = 3.5, the average power at a distance 2d is about 9 percent of the average power received at distance d. Thus, by adjusting the transmitter power level and/or the distance between co-channels, a channel can be reused by a number of co-channels if the Carrier-to- Interference ratio (CIR) in each co-channel is above the minimum CIR value. Here the carrier power

17

represents the received signal power in a channel, and the interference represents the sum of received signal powers of all co-channels. As an example, consider Fig. 1 where a wireless station labelled R is at distances dt from a transmitter station labelled T using a narrowband radio channel. We refer to the radio channel used by T to communicate to R as the reference channel. In this figure, we have also shown five other stations labelled 1, 2. . . 5, which use the same channel as the reference channel to communicate with some other stations. Denoting the transmitted power of station i by Pi and the distance of station i from R by di, the average CIR at the reference station R is given by Eq. (1).

.eq.(1) Where, No represents the environmental noise; to achieve a certain level of CIR at the reference station R, different methods can be used.

3.2.2 Common Principles of Channel Allocation Schemes: The large array of possible channel allocation systems can become cumbersome. However, all channel allocation methods operate under simple, common principles. Throughout this report we have touched on three points which an efficient channel allocation scheme should address: 1. Channel allocation schemes must not violate minimum frequency reuse conditions. 2. Channel allocation schemes should adapt to changing traffic conditions. 3. Channel allocation schemes should approach (from above) the minimum frequency reuse constraints so as to efficiently utilize available transmission resources.

18

Fig. 3.6 Interference Three types of channel allocation strategies have been proposed and are divided into three categories [1]: 1. FCA 2. DCA 3. HCA

Fig 3.7 Channel Allocation Strategies

19

In FCA, the area is divided into the number of cells and a number of channels are assigned to each cell according to some reuse pattern and considering interference depending on desired sign signal quality as shown in Fig. 3.7

Fig.3.8 FCA strategy, a-g denote different sort of voice channels permanently assigned to cells FCA is very simple, easy to implement but they do not adopt to change in traffic conditions and user distributions. However FCA could not attain a high efficiency of total channel usage over the whole service area if the traffic varies from cell to cell. In order to overcome this problem DCA strategy has been proposed. In DCA, channels are assigned dynamically over plural cells in accordance with traffic intensity. In Flexible Channel Allocation (FICA) strategy, a set of available channels divided into two sets: fixed set and flexible set. The assignment of these emergency channels (fixed set and flexible set) among the cells done either in a scheduled or predictive manner. In Predictive strategy, the traffic intensity, call-blocking probability needs to be measured constantly at every cell site so that the reallocation of flexible channels carried out at any point in time. In Scheduled strategy, future changes in traffic distribution are pinpointed in time and space. To overcome these deficiencies, HCA scheme has been introduced. In HCA scheme total numbers of channels are divided into two sets: fixed set (same as FCA scheme) and dynamic set (same as DCA scheme).

20

3.2.3 Call blocking probability Several metrics can be used to evaluate and compare the performance of the proposed algorithm. The call blocking probability is defined as the ratio of the number of new calls initiated by a mobile host which cannot be supported by existing channel arrangement to the total number of new calls initiated. Call blocking probability (Pb) is given by the ratio of number of calls lost by the system to the total number of new calls initiated.

3.2.4 Fixed channel allocation In the FCA strategy a set of nominal channels is permanently allocated to each cell for its exclusive use [4]. Here a definite relationship is assumed between each channel and each cell, in accordance to co channel reuse constraints. The total number of available channels in the system C is divided into sets, and the minimum number of channel sets N required to serve the entire coverage area is related to the reuse distance s. N = (1/3) ^2, for hexagonal cells. Here is defined as D/Ra, where Ra is the radius of the cell and D is the physical distance between the two cell centres [5]. N can assume only the integer values 3, 4, 7, 9... as generally presented by the series, (i + j)2 i, j, with i and j being integers [5, 7]. Figures 4(a) and 4(b) give the allocation of channel sets to cells for N = 3 (0 = 3) and N = 7 (0 = 4.45), respectively. In the simple FCA strategy, the same number of nominal channels is allocated to each cell. This uniform channel distribution is efficient if the traffic distribution of the system is also uniform. In that case, the overall average blocking probability of the mobile system is the same as the call blocking probability in a cell. Because traffic in cellular systems can be non uniform with temporal and spatial Fluctuations, a uniform allocation of channels to cells may result in high blocking in some cells, while others might have a sizeable number of spare channels. This could result in poor channel utilization. It is therefore appropriate to tailor the number of channels in a cell to match the load in it by non uniform channel allocation or static borrowing. In non uniform channel allocation the number of nominal channels allocated to each cell depends on the expected traffic profile in that cell.

21

Fig. 3.9 FCA for pattern k=7 3.2.5 Channel borrowing scheme In a channel borrowing scheme, an acceptor cell that has used all its nominal channels can borrow free channels from its neighbouring cells (donors) to accommodate new calls [19] . A channel can be borrowed by a cell if the borrowed channel does not interfere with existing calls. When a channel is borrowed, several other cells are prohibited from using it. This is called channel locking. For example, for a hexagonal planar layout with reuse distance of one cell ( = 3), a borrowed channel is locked in three additional neighbouring cells, as is shown in Fig. 5, while for a one dimensional layout or a hexagonal planar grid layout with two-cell reuse distance, it is locked in two additional neighbouring cells. The channel borrowing schemes can be divided into simple and hybrid. In simple channel borrowing schemes, any nominal channel in a cell can be borrowed by a neighbouring cell for temporary use. In hybrid channel borrowing strategies, the set of channels assigned to each cell is divided into two subsets, A (standard or local channels) and B (nonstandard or borrowable channels). Subset A is for use only in the nominally assigned cell, while subset B is allowed to be lent to neighbouring cells.

22

Fig.3.10 Channel Locking Simple Channel Borrowing Schemes In the simple borrowing (SB) strategy, a nominal channel set is assigned to a cell, as in the FCA case [19]. After all nominal channels are used; an available channel from a neighbouring cell is borrowed. To be available for borrowing, the channel must not interfere with existing calls. Although channel borrowing can reduce call blocking, it can cause interference in the donor cells from which the channel is borrowed and prevent future calls in these cells from being completed. The SB strategy gives lower blocking probability than static FCA under light and moderate traffic, but static FCA performs better in heavy traffic conditions. This is due to the fact that in light and moderate traffic conditions, borrowing of channels provides a means to serve the fluctuations of offered traffic, and as long as the traffic intensity is low the number of donor cells is small. In heavy traffic, the channel borrowing may proliferate to such an extent, due to channel locking, that the channel usage efficiency drops drastically, causing an increase in blocking probability and a decrease in channel utilization.

The different schemes of simple channel borrowing are, 1. Simple borrowing (SB)

23

2. Borrow from the richest (SBR) 3. Basic algorithm (BA) 4. Basic algorithm with reassignment (BAR) 5. Borrow first available (BFA)

Hybrid channel borrowing scheme The different schemes of hybrid channel borrowing are, 1. Simple hybrid borrowing scheme (SHCB) 2. Borrowing with channel ordering (BCO) 3. Borrowing with directional channel locking (BOCL) 4. Sharing with bias (S H B) Channel assignment with borrowing and reassignment (CABR) 5. Ordered dynamic channel assignment with Re arrangement

Table 3.1 summarizes the channel borrowing scheme

24

3.2.6 Dynamic channel allocation Due to short-term temporal and spatial variations of traffic in cellular systems, FCA schemes are not able to attain high channel efficiency [14]. To overcome this, DCA schemes have been studied during the past 20 years. In contrast to FCA, there is no fixed relationship between channels and cells in DCA. All channels are kept in a central pool and are assigned dynamically to radio cells as new calls arrive in the system. After a call is completed, its channel is returned to the central pool. In DCA, a channel is eligible for use in any cell provided that signal interference constraints are satisfied. Because, in general, more than one channel might be available in the central pool to be assigned to a cell that requires a channel, some strategy must be applied to select the assigned channel. Based on information used for channel assignment, DCA strategies could be classified either as call -by- call DCA or adaptive DCA schemes [27]. In the call-by-call DCA, the channel assignment is based only on current channel usage conditions in the service area, while in adaptive DCA the channel assignment is adaptively carried out using information on the previous as well as present channel usage conditions. Finally, DCA schemes can be also divided into centralized and distributed schemes with respect to the type of control they employ. 1. Centralized DCA Schemes In centralized DCA schemes, a channel from the central pool is assigned to a call for temporary use by a centralized controller. The difference between these schemes is the specific cost function used for selecting one of the candidate channels for assignment. 2. First Available (FA) The simplest of the DCA schemes is the FA strategy. In FA the first available channel within the re use distance encountered during a channel search is assigned to the call. The FA strategy minimizes the system computational time; and, as shown by simulation. For a linear cellular mobile system, it provides an increase of 20 percent in the total handled traffic compared to FCA for low and moderate traffic loads. 3. Locally Optimized Dynamic Assignment (LODA)

25

In the LODA strategy, the selected cost function is based on the future blocking probability in the vicinity of the cell in which a call is initiated. 4. Channel Reuse Optimization Schemes The objective of any mobile system is to maximize the efficiency of the system. Maximum efficiency is equivalent to maximum utilization of every channel in the system. It is obvious that the shorter the channel reuse distance, the greater the channel reuse over the whole service area. The cost functions selected in the following schemes attempt to maximize the efficiency of the system by optimizing the reuse of a channel in the system area. 5. Selection with Maximum Usage on the Reuse Ring (RING) In the RING strategy, a candidate channel is selected which is in use in the most cells in the co channel set. If more than one channel has this maximum usage, an arbitrary selection among such channels is made to serve the call. If none is available, the selection is made based on the FA scheme.

Comparison between FCA & DCA In general, there is a trade-off between quality of service, the implementation complexity of the channel allocation algorithms, and spectrum utilization efficiency [1]. Under low traffic intensity, DCA strategies perform better. However, FCA schemes become superior at high offered traffic, especially in the case of uniform traffic. In the case of non uniform traffic and light to moderate loads, it is believed that the DCA scheme will perform better due to the fact that under low traffic intensity, DCA uses channels more efficiently than FCA. In the FCA case channels are pre assigned to cells, so there are occasions when, due to fluctuation in traffic, calls are blocked, even though there are channels available in adjacent cells. In addition, a basic fact of telephone traffic engineering is that a server with capacity C is more efficient than a number of small ones with the same total aggregate capacity. That is, for the same average blocking probability a system with high capacity has higher utilization. FCA schemes behave like a number of small groups of servers, while DCA provides a way of making these small groups of servers behave like a larger server. Then It is observed that in Fig. 6, with low traffic intensity DCA uses channels

26

more efficiently than FCA because of flexible channel assignment and shows good performance. But with high traffic intensity, DCA does not show better performance than FCA.

Fig.3.11 Traffic intensity and blocking rate. 3.2.7 Hybrid channel allocation Hybrid channel assignment schemes are a mixture of the FCA and DCA techniques [4]. In HCA, the total number of channels available for service is divided into fixed and dynamic sets. The fixed set contains a number of nominal channels that are assigned to cells as in the FCA schemes and, in all cases, are to be preferred for use in their respective cells. The second set of channels is shared by all users in the system to increase flexibility.

Fig 3.12 Hybrid Channel Allocation When a call requires service from a cell and all of its nominal channels are busy, a channel from the dynamic set is assigned to the call. The channel assignment procedure from the dynamic set follows any of the DCA strategies described in the previous section. Variations of the main HCA schemes include HCA with channel reordering and HCA

27

schemes where calls that cannot find an available channel are queued instead of blocked. The call blocking probability for an HCA scheme is defined as the probability that a call arriving to a cell finds both the fixed and dynamic channels busy. Performance evaluation results of different HCA schemes have been compared as in [4]. Theoretical study has done for an HCA scheme with Erlang-b service discipline for uniform size and shape cells where traffic is uniformly distributed over the whole system. The measure of interest is the probability of blocking as the load increases for different ratios of fixed to dynamic cells. For a system with fixed to dynamic channel ratio 3: 1, the HCA gives a better grade of service than FCA for load increases up to 50 percent. Beyond this load HCA has been found to perform better by case study. A similar pattern of behaviour is obtained from the analysis where the HCA scheme employed uses the FA DCA scheme and Erlang-c service discipline (calls that cannot find an available channel are queued instead of blocked). In addition, the HCA scheme with Erlang-c service discipline has lower probability of blocking than the HCA scheme with Erlang-b service discipline. In order to simplify the analysis of HCA we approximate the call blocking probability as a product of random pool as fixed channel allocation blocking probability and non random pool as dynamic channel allocation blocking probability.

28

3.3 Hot-spot condition in cells

Recent growth in mobile telephone traffic in wireless cellular networks, along with the limited number of channels available, presents a challenge for the efficient reuse of channels. Channel allocation problem becomes more complicated if one or more cells in the network become hot-spots for some period of time. The term HOT-SPOT means the bandwidth resources currently available in those cells are not sufficient to sustain the needs of current users in the cells [1 & 3]. In the condition of hot-spot base station sends a notification for borrowing channels to the central pool located at mobile switching station (MSC) on each channel request that cannot be satisfied locally at the base station. Notification to the central pool is according to the algorithm used. It can be One-by-one Multilevel

In One-by-one notification- base station will request only one channel at a time to the central pool to assign to the requesting cell. Control message is exchanged every time on each channel request. Multilevel - This notification will request more than one channel be assigned to the requesting cell, proportional to the current hot-spot level of the cell. With one control message number of channel are borrowed from the central pool according to the current level. 3.3.1 Hot-spot level When a call using such a borrowed channel terminates, the cell may retain the channel depending upon its current hot-spot level as in [2]. A level L =0 of base station is set at the beginning to indicate that, at the present time, the channel request can be accommodated from the fixed (static) list assigned to the cell. When a mobile host wants to initiate a call, it sends the channel request on the control channel to its related base station. If the base station has an available channel from its current fixed channel list, it will assign the channel to the mobile host.

29

If no channel from the fixed list for the cell is available, then the base station updates the value of L as follows: L = L +1; The base station estimates the current level of hot-spot, h in the cell. If H is less than or equal to the old value of level L, HL Meaning that the congestion in the cell is the same or easing, If H is greater than the old value of level L H>L Meaning that the congestion in the cell is getting worse, Multilevel notification has low overhead as compared to one-by-one notification on its current hot-spot level. Low-overhead in terms of the number of control messages exchanged between a base station and the MSC on channel acquisition and release phases.

30

3.4 Hybrid channel assignment schemes

Hybrid channel assignment strategies combine both static and dynamic assignment properties by applying a fixed assignment for some interfaces and a dynamic assignment for other interfaces [15, 16, 13]. Hybrid strategies can be further classified based on whether the fixed interfaces use a common channel [13] or varying channel [15, 16] approach. The fixed interfaces can be assigned a dedicated control channel or a data and control channel [13], while the other interfaces can be switched dynamically among channels. Hybrid assignment strategies are attractive because, as with fixed assignment, they allow for simple coordination algorithms, while still retaining the flexibility of dynamic channel assignment. In the next two subsections we describe two hybrid schemes for CA.

Fig.3.13 Hybrid channel allocation

3.4.1 Link Layer Protocols for Interface Assignment Innovative link layer interface assignment algorithm (LLP) [15] categorizes available interfaces into fixed and switchable interfaces. Fixed interfaces are assigned, for long time intervals, specific fixed channels, which can be different for different nodes. On the other hand, switchable interfaces can be switched over short timescales among non-fixed channels based on the amount of data traffic. By distributing fixed interfaces of different nodes on different channels, all channels can be used, while the switchable interface can be used to maintain connectivity. Two coordination protocols based on hash functions and the exchange of Hello packets are proposed in [15] to decide which channels should be assigned to the fixed interface and manage communication between nodes. In [16] the

31

authors propose a CA scheme based on the second coordination protocol, but this scheme does not take into account the traffic load in assigning the fixed channels.

3.4.2 Interference-Aware Channel Assignment The channel assignment problem in wireless mesh networks in the presence of interference from collocated wireless networks is addressed in [13]. The authors propose a dynamic centralized interference-aware algorithm (IACA) aimed at improving the capacity of the WMN backbone and minimizing interference. This algorithm is based on an extension to the conflict graph concept described in [9], called the multi radio conflict graph (MCG), where the vertices in the MCG represent edges between mesh radios instead of edges between mesh routers. To compensate for the drawbacks of a dynamic network topology, the proposed solution assigns one radio on each node to operate on a default common channel throughout the network. This strategy ensures a common network connectivity graph [13], provides alternate fallback routes, and avoids flow disruption by traffic redirection over a default channel. This scheme computes interference and bandwidth estimates based on the number of interfering radios, where an interfering radio is a simultaneously operating radio that is visible to a mesh router but external to its network. The channel assignment scheme works on a rank-based strategy where the rank for every available channel is based on interference and load. The load, however, is considered for external wireless networks only.

3.4.3 Hybrid channel allocation with hot-spot HCA performs better than any other channel allocation schemes in terms of call dropping and blocking by using hot-spot notification and central pool [3]. When new call arrives in hot-spot cell than automatically a channel is assigned to that call from central pool till traffic in the cell goes to normal level. In heavy traffic load HCA is capable to minimize call blocking probability. A level is maintained i.e. (L=0) of the cell in the beginning to indicate that the channel request can be accommodated from the fixed set and there is no hot-spot cell in the network. Now when a mobile user wants to connect a call, it request for a channel from its base station. If the base station has channels available in fixed set, it will assign channel to incoming channel request. But if no channel available in fixed set, then base station update

32

its level by 1 & sends a channel request to the central pool in order to borrow channels from MSC. Channel request include base station current level and maximum level. On receiving channel request from base station MSC will assign channels from the central pool to base station up to the requesting level at the same time base station add the same number of channel to its temporary pool. As the traffic increases, base station maintains its level on each channel request. When a call terminates base station check the type of channel the call belonged to. If the channel belonged to fixed set then it remain in base station but if channel belonged to dynamic pool, now base station is required to estimate or check its level, if its level is below hot-spot level than channels are retained to MSC from its temporary pool otherwise remain in base station itself. If the base station level is greater or equal to hot-spot level, meaning that the congestion in the cell is same or getting worse, now the channels remain in the cell itself in the temporary pool of base station in order to sustain more calls. Condition becomes critical when MSC has no channel available in its central pool and channel request arrives from any cell. In this case, call starts dropping or blocking.

33

4. PROPOSED METHODOLOGY

In this thesis, an optimal method for hybrid channel allocation with hot-spot is proposed. A review of various method and techniques of channel allocation was presented in the chapter 2. The technique proposed by Rana Ejaz Ahmed [2], is inspiring us for the development of hybrid channel allocation. In this thesis, hot-spot technique is used for hybrid channel allocation in order to decrease call drop rate in the cellular network. The system uses a hybrid channel allocation scheme where as in [3,] the total number of C channels is divided into two disjoint sets, F and D. The set F contains the channels for fixed (or static) assignment, while the set D contains the channels for dynamic assignment, i.e., C = F U D. Moreover, each base station maintains a temporary pool (called T) to retain a channel that was originally transferred from the dynamic assignment pool at MSC. The system uses a frequency reuse factor N. The fixed channels are assigned to a cell statically as in FCA; while dynamic channels are kept in a centralized pool at MSC. Let r be the ratio of the number of dynamic channels to the total number of channels available in the system, [13] i.e., r = |D| / |C|. The value of r depends upon the traffic condition as well as on designers view. The hot-spot notification level is a multiple of 2, such that 2i Where i is an integer i.e. 0, 1, 2, 3..& H = {1, 2, 4, 8.... M} Where M= pre-defined maximum level supported by the system. & H= represents the fact that up to H borrowed channels can be retained by the base

station after a call on the borrowed channel from that cell terminates. The work which is presented here is for efficient management of unused channels. The unused channels are returned back to MSC on cell request, if there is non- availability of channels. The request is implemented by rending the whole process in two phases [3].

34

a) Channels Acquisition Phase. b) Channels Release Phase.

The flowchart for the proposed system is shown in fig 4.1 & fig 4.2 4.1 Channel Acquisition phase Initially hot-spot level is set to 0 i.e. L=0 of base station. When a mobile host (MH) wants to initiate a call, it requires some frequency to setup a call. These frequencies are provided in the form of channels. Firstly MH comes in the range of any one BSC, and then MH sends channel request to that BSC in order to connect a call. Algorithmically, 1. MH, requests a channel from Base Station to initiate a call. 2. If channels are available, in local pool of base station that is in set F (fixed channel), the same will be allocated and channel acquisition phase terminates. Base station can provide the channels until it have channel in its local pool. Otherwise the condition can become that base station has no channel in its local pool. 3. Now Hot-spot notification value is updated (when its local pool gets exhausted) asH=H+1 H= max (H, X) And Base station sends the request accordingly to the dynamic pool located at BSC. Where H is numbers of channels are requested to dynamic pool. H numbers of channels are provided to base station so that it does not require requesting again and again for channels in the time of hot-spot. Because hot-spot is the condition when traffic increases in the network, and there are requirements of more and more channels. Level H is increases further as traffic increases. 4. If BSC have no channels available in its dynamic pool and cannot allocate even one channel, then the channel requests cannot be fulfil call can be dropped.

35

This can be posed as a limitation to the approach which can be overcome if the MSC on certain interval of time sends notification to BS for requirement of unused and extra channels provided by the MSC during Channel acquisition phase in step 3. The only reason for allocating H+ 1 channel to BS instead of H is a proactive measure, because request is generated by hot-spot cell which is dealing with heavy load and it is assumed that in near future it will require more communication bandwidth, so as to reduce overhead up to some extent, this particular fashion is adopted. But, as seen in step 4 of Channel acquisition phase, the situation of call dropping can be avoided if unused channels with any cell can be retrieved. So, here to manage channel allocation scheme in a better way, step 4 can be modified as5. If MSC cannot allocate even one channel, then Channel retrieval phase will be initiated. Now suppose in Channel retrieval phase, dynamic pool gets exhausted then a). MSC notifies all BS which borrowed a channel from dynamic pool to return unused channel, if any.

Fig.4.1 Flowchart for Channel acquisition phase

36

b). On receiving such request (notification), those BS, having the same will return the unused bandwidth to MSC. c). On retrieving bandwidth Channel retrieval phase terminates, and request of any hotspot BS is served.

4.3 Channel release phase Lastly, the issue of channel emancipation, if a call gets terminated at any MH. So, algorithmically, 1. On termination of any call at MH, a channel, let us suppose ki gets free and is to be returned back either to local pool at BS site or dynamic pool at MSCs site. 2. On analyzing that the released channel belongs to dynamic pool, before returning, the BS estimates the current value of hot-spot level (let us say, H), in the cell. If H is less than or equal to the old value of level L, HL Meaning that the congestion in the cell is the same or easing, in this case after checking its temporary pool, channel is returned back to MSC. Else If H is greater than the old value of level L H>L Meaning that the congestion in the cell is getting worse, in this case Channel ki is retained in its temporary pool as condition got worse, and cell is in urgent need of communication bandwidth.

37

Fig 4.2 Flowchart for Channel release phase

From the flowcharts channel acquisition phase and release phase can be easily understand. Due to the limitation of bandwidth, it is required to use the bandwidth efficiently. Our proposed algorithm is also tends to use the bandwidth efficiently and decrease rate of call drop. In communication system the foremost requirement is to decrease call drop and call block.

38

5. IMPLEMENTATION

In the previous chapter, we have seen the details of overall communication system. Hybrid channel allocation and hot-spot condition also shown in [1,2, and 3] which is essential for proposed optimal hybrid channel allocation technique with hot-spot notification. We have given thorough description of all the three channel allocation, namely fixed channel allocation, dynamic channel allocation and the hybrid channel allocation. To evaluate the effectiveness of our approach, a cellular network is simulated over OMNeT++ simulation environment which is an Integrated Development Environment and is based on the Eclipse platform, and extends it with new editors, views, wizards, and additional functionality. OMNeT++ adds functionality for creating and configuring models (NED and ini files), performing batch executions, and analyzing simulation results, while Eclipse provides C++ editing, SVN/GIT integration, and other optional features (UML modelling, bug tracker integration, database access, etc.) via various open-source and commercial plug-ins [10]and results are expounded in various scenarios viz. Fixed channel allocation scheme, and hybrid channel allocation scheme by varying the number of dynamic channels used, and the behaviour is studied in terms of Call drop rate and Blocked call rate versus System load.

In this chapter we have reported database which is described in section 5.1 and section 5.2 covers experimental setup for the proposed system.

5.1 Database
The parameters and scenarios used in this simulation are illustrated in this section in which we have simulated the approach on over environment with total available channels i.e. K=300 over a BS grid of 66 over a area of 50,00050,000 meteres2 with one Mobile switching Centre. Now, the approach has been evaluated for four different scenarios. Firstly, with fixed channel allocation Scheme for all available channels, and secondly, by varying the number of dynamic channels used by 30, 150 and 240 channels which in turn will vary the ratio of the number of dynamic channels to the total number of channels available in the system.

39

5.2 Experimental Setup

Here we are describing every step of establishing communication system. First of all BSC is located in the network. The Basic switching centre basically manages the BTSs. It reserves radio frequencies, handles the hand over, and performs the paging of the MS. The BSC also multiplexes the radio channels onto the fixed network connection at the air interface. Air is interface through which signals can be transmitted. Any messages which are transferred between BSC, BTS and ms are transferred through this air.

Fig. 5.1 BSC is located in the network

Air is interface through which signals can be transmitted. Any messages which are transferred between BSC, BTS and ms are transferred through this air. Message which are transferred from mobile station to BTS are like connection request, disconnect request, check BTS, mobile station data, check line etc. Similarly message which are transferred from BTS to ms are like connection acknowledgement, disconnect acknowledgement, force disconnect, handover ms, check ms, BTS data etc.

40

Fig. 5.2 MS are located in the network

Now mobile user is located in the network. All the mobile users are connected to the air. Every mobile station MS are also connected to the GSM Public Land Mobile Network (PLMN) via Um interface i.e. air. GSM-PLMN is the infrastructure needed for the GSM network. GSM permits the integration of different voice and data services and the integration with existing network make a network interesting for customers. The MS comprises all user equipment and software needed for communication with the GSM network.

Fig. 5.3 BTS are located in the network

41

As shown in the fig. after MS, BTS is located in the network. BTS is Base Transceiver System. Each BTS is connected to the BSC. A BTS comprises all radio equipment i.e. antennas, signal processing, amplifiers necessary for radio transmission. A BTS can form a radio cell or, using sectorized antennas, several cells and is connected to MS via interface. Now when mobile user wants to initiate the call, it request BTS for the channel available in the local pool. As shown in the fig. MS sends the connection request message to BTS. BTS has two pool first is local pool and another is temporary pool. Channels with are fixed allocated is stored in local pool while the channels which are borrowed from the dynamic pool of BSC is stored in temporary pool. Channels are returned back to BSC from temporary pool after the requirement is over. Since our proposed method is through hotspot notification, thats why more channels get stored in the temporary pool in the high traffic.

Fig. 5.4 Message from MS to BTS

As shown in the fig. connection acknowledgement is given by BTS to MS. Now BTS will provide the channel to MS from local pool, if channels in local pool are available. In this way channel acquisition phase completed. Now the condition become complicated when there are no channels available in the local pool, in this situation

42

Fig. 5.5 Messages from BTS to MS

BTS sends channel request message to the dynamic pool of BSC. Channels are suppied from dynamic pool to BTS and assigned to requesting MS. Channels which are supplied from dynamic pool are not coming one by one but according to hot-spot level. If the level is 2 then 2 channels are supplied similarly if the level is 14 then 14 channels are provided and vice versa. In the time of hot-spot (high traffic) hot-spot level goes on increasing similarly decreases in low traffic. Temporary pool return the channels according to the current level of hot-spot. Some of the channels even remain ideal for some period of time, because temporary have to maintain the level of current hot-spot. According to our proposed method, these ideal channels are fetched by BSC. This fetching situation comes when BSC have no channel available in the dynamic pool and there are requirement of channels from different BTS in the time of hot-spot. It is not necessary that BSC can fulfill all the requirement of BTS, but upto some extend call drop can be avoided.

43

6. EXPERIMENTAL RESULTS

6.1 Performance Evaluation

The parameters and scenarios used in this simulation are illustrated in this section in which we have simulated the approach on over environment with total available channels i.e. K=300 over a BS grid of 66 over a area of 50,00050,000 meteres2 with one Mobile switching Centre, the approach has been evaluated for four different scenarios. Firstly, with fixed channel allocation Scheme for all available channels, and secondly, by varying the number of dynamic channels used by 30, 150 and 240 channels which in turn will vary the ratio of the number of dynamic channels to the total number of channels available in the system(i.e. h=number of dynamic channel/total number of channels) and the results are tabulated below. Parameters evaluated from Hybrid Channel Allocation using hot-spot notifications are as follows: (1) Successful call percentage (2) Call drop rate (3) Call block rate (4) Handover rate The above parameters can be calculated as follows: Successful call percentage = Call drop rate = Call block rate =

The main objective of the proposed system is to obtain decrease no. of call drop rate, call block rate and handover. Here we present our simulation result in the form if table.

44

6.1.1 Call Block Evaluation: System load 0.25 0.5 0.75 1 1.25 0 2.00 6.04 15.34 20.65 Call blocked rate fca h=0.1 0 2.45 5.02 9.56 18.98 h=0.5 0 1.26 4.39 10.48 15.66 h=0.8 0 0.46 3.65 10.23 14.87

Table 6.1 Call block rate in traditional system System load 0.25 0.5 0.75 1 1.25 0 1.48 5.20 13.53 18.41 Call blocked rate fca h=0.1 0 1.59 4.99 10.28 16.09 h=0.5 0 0.26 4.39 8.48 15.66 h=0.8 0 0.22 3.21 6.59 10.88

Table 6.2 Call block rate in our proposed system

The obtained results, illustrates the expound effectiveness of work in terms of call dropped and call blocked compared against system load in both cases in different scenarios mentioned above and compared with and without employing Hybrid Channel allocation scheme. In the case of HCA, three different cases of different ratio of the number of dynamic channels to the total number of channels available in the system i.e. D has been considered as 30, 150 and 240 channels (i.e. h=0.1, 0.5, 0.8). In implementation, number of MSC is 1 in all cases for the sake of simplification. The results are illustrated graphically to show the behaviour of network with above defined approach.

45

Fig. 6.1 Call Block versus system load in traditional system

Fig. 6.2 Call block versus system load in our proposed method

Fig 6.2 shows the blocking probability versus system load according to [3]. Here as compared to our result in fig 6.1 we observed that blocking probability is comparatively

46

low. When the system load increases to 125 for fixed channel allocation in fig 6.2 blocking probability is 0.65 whereas in fig 6.1 blocking probability is 0.42. In h= 0.8, 240 channels are dynamic in 300 total channels, here the call block rate is 0.17 in our proposed system whereas in traditional it is 0.2. Reason behind it is this, in the time of hot-spot there is requirement of more dynamic channels to serve the mobile user. It is also obvious that on increasing system load the call blocked will increase respectively. It is observed from above illustrated results that call blocked in a cellular network if FCA is deployed is more than if available channels are distributed among subsets for static and dynamic assignments and this proportion is varied.

6.1.2 Call Drop Evaluation:

System load 0.25 0.5 0.75 1 1.25

Call drop percentage fca 0 7.12 16.89 26.09 30.10 h=0.1 0 5.31 14.56 27.13 27.56 h=0.5 0 6.1 12.61 28.02 24.88 h=0.8 0 4.11 11.09 25.10 29.17

Table.6.3 Call drop rate in traditional system

System load 0.25 0.5 0.75 1 1.25

Call drop percentage fca 0 4.81 14 19.70 22.30 h=0.1 0 5.31 13.75 22.03 25.30 h=0.5 0 4.74 12.61 9.71 24.88 h=0.8 0 4.22 11.83 20.43 8.98

Table.6.4 Call drop rate in our proposed method

47

Fig. 6.3 Call drop rate versus system load in traditional system

Fig. 6.4 Call drop rate versus system load in our proposed method

Similarly, if pattern of Call dropped is observed a slight improvement is seen when hybrid approach is used as compared to its fixed counterpart. An unexpected increase in

48

call drop rate is observed when the number of channels in dynamic pools was 30 i.e h=0.1,in both the system which might be the result of abrupt network traffic pattern and other parameters which affects the performance such as poor connectivity, interference, and many more. In h=0.5, both system give almost same result. Here best outcome is observed when number of dynamic channels is varied to 240 i.e. h=0.8, where call drop rate is least for increasing load. In the traditional system it was 28 whereas in our proposed system it decreases to 22.

6.1.3 Handover Calls Evaluation:

System load 0.25 0.5 0.75 1 1.25

Handover Calls fca 1300.12 1288.56 1198.11 1009.98 800.60 h=0.1 1356.12 1298.65 1100.21 945.21 712.34 h=0.5 1357.28 1300.19 1009.5 1000.88 803.76 h=0.8 1357.35 1305.92 1009.8 998.76 1000.20

Table. 6.5 Handover calls rate in traditional system System load 0.25 0.5 0.75 1 1.25 Handover Calls fca 1284.64 1145.52 1000 615.23 502.61 h=0.1 1287.31 1156.34 930.68 645.36 467.34 h=0.5 1287.31 1212.10 946.83 1085.88 577.76 h=0.8 1287.31 1220 990.27 870.10 998.20

Table. 6.6 Handover calls rate in our proposed method

49

Fig. 6.5 Handover versus system load in traditional system

Fig. 6.6 Handover versus system load in our proposed system

In the case of handover we observed that when the ratio of dynamic channels is low, handover occurs more in all the three cases where it was traditional or our proposed system. But as the dynamic channels are increases and system load increases, then handover decreases. As compared to traditional system clearly our proposed method cause low handover. If we focus on h=0.8 in both cases, our method gives 1000 handover

50

whereas in above system it was 1200. So it is clear that proposed method performs better in any case. So in all the result we observed that as the ratio of dynamic channels increases, in all aspect performance becomes good. For the better communication system, it is required to vary the number of dynamic channels as per the traffic grows. For low traffic condition, even FCA performs better. Proper management system should to be maintaining in the time of high traffic and in the time of hot-spot to manage the entire mobile user.

51

7. CONCLUSION

The demand in the mobile communication has remarkably grown in the last two decade. An efficient channel allocation is essential to achieve the good performance in cellular system. While the limited number of channels available, requires efficient reuse of channels. To resolve this problem various channel allocation scheme developed by researchers. The present work is carried in the general context of channel allocation issue involved in cellular networks at heavy load situations. The simulation of this approach is expounded and evaluated over OMNeT++ in a scenario with fixed channel allocation and hybrid approach by varying the proportion of dynamic channels to total number of channels available and the effectiveness is evaluated in terms of Call blocked and Call dropped versus System load. The work presented here illustrates the efficiency and flexibility of hybrid channel allocation algorithm along with a slight modification in conventional algorithm by introducing the channel retrieval phase which retrieves back the channels with BS, borrowed from MSC and are unused and allocates the same to some BS requiring it and thus resolving the limitation of MSC of being exhausted of communication bandwidth to serve further calls in heavy load. The call effectiveness of the work has been illustrated in simulation where the approach performs better in almost all cases as compared to its fixed counterparts. If we compare the result of traditional system and proposed system then, call block rate in h= 0.8, 240 channels are dynamic in 300 total channels, the call block rate 0.17 in our proposed system whereas in traditional it was 0.2. Our method decreases the call block rate but call drop is reduced even more. In the traditional system it was 28 whereas in our proposed system it decreases to 22. Similarly hand over calls also reduces. If we focus on h=0.8 in both cases, our method gives 1000 handover whereas in above system it was 1200. So it is clear that proposed method performs better in each and every case. The simulation study of the protocol indicates that the protocol has low overhead, and it behaves similar to the FCA at high traffic and to the DCA at low traffic loads. So by the experimental and simulated evaluations of all channel assignment schemes we proposed that HCA will give the appropriate results in reducing call blocking probability. Further research has to be continued on HCA by increasing number of hotspot levels by considering interference as a main parameter

52

8. REFERENCES

[1] M.L.S.N.S. Lakshmi, M.S.L. Ratnavathi and S. Gopi Krishna,An insight to call blocking probabilities of channel assignment schemes International Journal of Advances in Engineering & Technology, May 2012. [2] Rana Ejaz Ahmed, A channel allocation algorithm using hot-spot notification for wireless cellular networks IEEE CCECE/CCGEI, Ottawa, May 2006 [3] Rana Ejaz Ahmed, A Channel Allocation Algorithm for Hot-Spot Cells in Wireless Networks , Journal of advances in information technology, vol 1,no. 3,august 2010. [4] Y.S.V.Raman1, G.Sricharan2, G.Naveen Kumar2, B.Siddardha2, The Performance Evaluation of Hybrid Channel Allocation Strategy in Cellular Networks, International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 mayjun 2012

[5] Jiming Chen, Senior Member, IEEE, Qing Yu, Peng Cheng, Youxian Sun, Yanfei Fan, and Xuemin Shen, Fellow, IEEE, Game Theoretical Approach for Channel Allocation in Wireless Sensor and Actuator Networks, IEEE transactions on automatic control, vol. 56, no. 10, october 2011 [6] S. Malathy and G. Sudha Sadasivam, Design of Optimal Channel Allocation for Mobile Users in Cellular Networks, European Journal of Scientific Research ISSN 1450-216X Vol.69 No.4 (2012), pp. 599-606 EuroJournals Publishing, Inc. 2012 [7] Mohamed Kadhem Karray and Yasir Khan, Evaluation and comparison of resource allocation strategies for new streaming services in wireless cellular networks, 1978-1-4673-10086/12/$31.00 c 2012 IEEE [8] Gunter Reise and Gerald Matz, Optimal transmit power allocation in wireless sensor networks performing field reconstruction , 978-1-4673-0046-9/12/$26.00 2012 IEEE

53

[9] Fan Wu and Nitin Vaidya, Workload-Aware Opportunistic Routing in Multi-Channel, MultiRadio Wireless Mesh Networks, 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON). [10] Prof. Dr.-Ing. Jochen Schiller, http://www.jochenschiller.de/ MC SS05, Mobile Communications Chapter 2: Wireless Transmission [11] Yu cheng, hongkun li, and peng-jun wan, A Theoretical framework for optimal cooperative networking in multiradio multichannel wireless networks, IEEE Wireless Communications April 2012 [12] Ashish Raniwala, Kartik Gopalan and Tzi-cker Chiueh, Centralized Channel Assignment and Routing Algorithms for Multi-Channel Wi reless Mesh Networks, Mobile Computing and Communications Review, Volume 8, Number 2 [13] J Joshi, G Mundada, A hybrid channel allocation algorithm to reduce call blocking probability using hot-spot notification, Information and Automation for sustainability, 2010 ieeexplore.ieee.org [14] Hasan C am, Nonblocking OVSF Codes and Enhancing Network Capacity for 3G Wireless and Beyond Systems, Proc. of The 2002 International Conference on Wireless Networks, June 24-27, 2002, Las Vegas, USA

[15] Habiba Skalli, IMT Lucca Institute for Advanced Studies Samik Ghosh and Sajal K. Das, The University of Texas at Arlington, Channel Assignment Strategies for Multi radio Wireless Mesh Networks: Issues and Solutions. IEEE Communications Magazine November 2007 [16] Geetali Vidyarthi, Alioune Ngom, and Ivan Stojmenovic, A Hybrid Channel Assignment Approach Using an Efficient Evolutionary Strategy in Wireless Mobile Networks, IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 54, NO. 5, SEPTEMBER 2005 [17] Wei Wang and Xin Liu, List-coloring Based Channel Allocation for Open-Spectrum Wireless Networks, University of California, Davis Davis, CA 95616, U. S. A. [18] Ray Guang Cheng & phone Lin, OVSF Code Channel Assignment For IMT-2000 0-7803-5718-3/00$10.00 2000 IEEE.

54

[19]

I.Katzela,M.naghshineh,channel

Assignment

Schemes

for

cellular

mobile

Telecommunication Systems:A comprehensive Survey,IEEE pers.comm,pp-10-31,june 1996 . [20] Jun Sun, Eytan Modiano, Senior Member, IEEE, and Lizhong Zheng, Member, IEEE], Wireless Channel Allocation Using an Auction Algorithm, IEEE Journal on selected areas in communications, vol. 24, no. 5, may 2006 [21] Chi Chung Lam, An Efficient Distributed Channel Allocation Algorithm Based on Dynamic Channel Boundaries, 1996 - ieeexplore.ieee.org [22] Pang Leang Hiew & Moshe Zukerman,Efficiency Comparison of Channel

Allocation

Schemes for Digital Mobile Communication Networks, IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 49, NO. 3, MAY 2000 [23] 3. Y Zhang, E Salari, A hybrid channel allocation algorithm with priority to handoff in mobile cellular networks, Computer Communications, 2009 Elsevier calls

55