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.06). 12/2001; 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

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In the design of cellular telecommunications networks, the handover and cabling cost management play an important role. In this paper, we propose a cell assignment problem, which assign cells in Personal Communication Service (PCS) to switches in wireless ATM network in an optimal manner. This is a complex integer programming problem and modeled as multi-homing cell assignment problem. Since finding an optimal solution of this problem is NP-hard. The proposed method, based on genetic algorithm, solve this problem. We implement this problem in MATLAB using GA and find better results.
    International Journal of Engineering Science and Technology. 01/2011;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present and analyze a Tabu Search (TS) algorithm for Dynamic Spectrum Allocation (DSA) in cellular networks. We study a case where an operator is providing packet services to the endusers. The objective of the cellular operator is to maximize its reward while taking into account the trade-off between the spectrum cost and the revenues obtained from end-users. These revenues are modeled here as an increasing function of the achieved throughput. The cost is proportional to the bandwidth of the spectrum leased to the regulator or some spectrum broker. Results show that the algorithm allows the operator to increase its reward by taking advantage of the spatial and temporal heterogeneities of the traffic in the network, rather than assuming homogeneous traffic for its radio resource allocation. Our TS-based DSA algorithm is efficient in terms of the required memory space and convergence speed. Results show that the algorithm is fast enough to suit a dynamic context.
    Transactions on Emerging Telecommunications Technologies. 10/2012; 23(6).
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a simple heuristic method, combined with a single-swap mutation, for minimizing the use of available channels in wireless communication networks. The task is to allocate carriers or channels to satisfy all demands in each cell for a particular network, subject to a number of constraints. The proposed method is to get the least number of channels without violating the constraint set. We test the proposed methodology on benchmark problems and manage to produce good quality solutions within a few seconds. Some of the results are very close to optimality, making this method suitable for generating initial solutions for population based approaches, such as genetic algorithm and artificial immune systems, to search for even better quality solutions.
    Advanced Communication Technology (ICACT), 2013 15th International Conference on; 01/2013