An efficient heuristic algorithm for channel assignment problem in cellular radio networks

Dept. of Software & Inf. Sci., Iwate Prefectural Univ.
IEEE Transactions on Vehicular Technology (Impact Factor: 2.64). 12/2001; 50(6):1528 - 1539. DOI: 10.1109/25.966583
Source: IEEE Xplore

ABSTRACT This paper presents an efficient heuristic algorithm for the
channel assignment problem in cellular radio networks. The task is to
find channel assignment with minimum frequency bandwidth necessary to
satisfy given demands from different nodes in a cellular network. At the
same time the interference among calls within the same cell and from
different neighboring cells are to be avoided, where interference is
specified as the minimum frequency distance to be maintained between
channels assigned to a pair of nodes. The simplest version of this
problem, where only cochannel interferences are considered, is
NP-complete. The proposed algorithm could generate a population of
random valid solutions of the problem very fast. The best among them is
the optimum or very near to optimum solution. For all problems with
known optimal solutions, the algorithm could find them. A statistical
estimation of the performance of the proposed algorithm is done.
Comparison with other methods show that our algorithm works better than
the algorithms that we have investigated

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: There is a rapidly growing demand for wireless telecommunication. The restricted number of channels is a significant bottleneck for the capacity of mobile communication systems. Consequently, when assigning the channels to the different base stations, it is desirable to reuse the same channel af much as possible. It is then important to avoid any possible interference between different mobile users, while satisfying the given demand. The objective of this thesis is to develop a hybrid heuristic algorithm to find the channel assignment method for allocating the channels in an efficient way, which does not violate the compatibility constraints. We also show several benchmarking channel assignment problems using proposed channel assignment method for validation in this thesis.
    The KIPS Transactions PartC 01/2004; 11C(2). DOI:10.3745/KIPSTC.2004.11C.2.203
  • [Show abstract] [Hide abstract]
    ABSTRACT: The Frequency Assignment Problem is assignment of frequencies or channels to establish link between base station and mobile transmitter in cellular system. To avoid interference, minimum separation between assigned frequencies is required. This problem is NP-hard. Due to limited availability of spectrum and reuse of same frequencies at different geographical locations, an excellent assignment is to be done, which must satisfy electromagnetic constraints with respect to demand in each cell. This paper presents a novel DGWCHD algorithm for frequency assignment problem in cellular radio networks. The objective is to assign the frequency satisfying electromagnetic constraints for given demand with minimum use of frequency bandwidth. The proposed algorithm is based on real wild animal's using intelligent strategies during chasing and hunting their prey, such dogs as agents, implemented on Chakaborty's benchmark problem constructed the 55-Cell FAP problems using other benchmark problems. The DGWCHD algorithm has been used for call ordering and FEA strategy for assignment. The performance of the proposed DGWCHD algorithm has been compared with other techniques. The results obtained are very optimistic and encouraging.
    2014 International Conference on Signal Processing and Integrated Networks (SPIN); 02/2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper deals with the channel assignment problem in a hexagonal cellular network, having non-homogeneous demands in a 2-band buffering system. We first partition the given problem into smaller subproblems each of which is constituted by a homogeneous demand vector on a simple subgraph of the original network graph. The subgraphs and the demands on each node of these subgraphs are chosen in such a way that all the required channels can be assigned to these nodes with the minimum bandwidth by repeating an appropriate sequence of channels in a regular and systematic manner, without causing any interference. Based on this idea, we next present an algorithm for solving the channel assignment problem with non-homogeneous demands. When tested on the Philadelphia benchmark problems, the proposed algorithm assigns the channels with a band width always within 5% more than the optimal bandwidth, requiring a very small execution time (less than 50 mSec on a HPxw8400 workstation). In contrast to this, the best known algorithm [S. C. Ghosh, B. P. Sinha and N. Das, “Coalesced CAP: An improved technique for frequency assignment in cellular networks”, IEEE Trans. Vehicular Technology 55, 640–653 (2006)] generates optimal assignments with about 10–20 seconds on a comparable workstation. This makes our proposed algorithm attractive for very fast assignments of channels in real-life situations, with a marginally small deviation from the optimal bandwidth.