Dynamic channel allocation in mobile cellular networks

Channel assignment problem is one of the main issues in radio networks. Having limited number of possible channels and unlimited demands it has become a challenge for the network planners to allocate channels in optimized ways. In the early days of radio technology, conflict free fixed channel assignment was the main target. But in the present days, dynamic channel allocation is used. In this paper, an algorithm has been developed, which will be able to allocate channels dynamically. In a certain area, there can be different demands; in the morning the demand may be increased and in the evening the demand may be reduced. This algorithm, based on Greedy method, is able to assign the radio channels dynamically according to dynamic demands.