ABSTRACT:

A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.

Description of the Problem

This project analyzes a channel allocation algorithm in a cellular network. The system has been designed with focus on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, there is a need of algorithm that is  fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.

Existing System:

                        The channel allocation algorithm  in cellular network follows the centralized approaches , request for channel is sent to and processed by a central controller, called Mobile Switching Center (MSC). But, this approach is

• neither scalable nor robust because the MSC could become a bottle-neck when the traffic load is heavy
• and the failure of the MSC will bring down the entire system.
• Bad performance
• It will not co operate with failure of MSC case
• MSC make use of static information

Proposed System:

            In this project we are focused on the channel allocation issues in cellular networks where the Base Stations (also known as Mobile Service Stations) are mobile. This imposes more challenges since the neighborhood information changes dynamically. Here, we restrict our discussion to channel allocation in cellular networks where mobile service stations are static. We also discuss dynamic load balancing strategy for the channel assignment problem in cellular mobile environment. The proposed algorithm: load balancing with selective borrowing (LBSB) is a centralized approach. In this algorithm, a cell can be classified either as a hot or a cold  cell according to the value of its degree of coldness. The degree of coldness of a cell is defined as the ratio of number of available channels in this cell and the number of channels which have been allocated to this cell beforehand. The goal of the algorithm is to migrate unused channels from cold cells to hot cells. This algorithm solves the teletraffic hot spot problem in cellular networks. A hot spot is defined as a stack of hexagonal rings of cells and is termed complete if all the cells within it are hot. Load balancing is achieved by using a structured channel borrowing scheme, in which a hot cell can borrow channels only from adjacent cells in the next outer ring. Thus, unused channels are migrated into a hot spot from its peripheral rings. We have to check whether a cell needs to borrow a channel, it has to wait until it gets reply messages from all its interference neighbors. This makes the algorithm not fault tolerant since real-life cellular networks may encounter network congestion and/or failures, including link failure and mobile service station failures. The proposed algorithm is a  a fault-tolerant distributed dynamic channel allocation algorithm for cellular networks under the 3-cell.

SOFTWARE REQUIREMENTS:
• Web Technologies : HTML, CSS, JS. JSP
• Programming Language : Java
• Database Connectivity : JDBC
• Backend Database : MySQL
• Operating System : Windows 08/10
HARDWARE REQUIREMENTS:
• Pentium processor : Core I3
• RAM Capacity : 2GB
• Hard Disk : 250GB
• Monitor : 15’’ Color Monitor