No abstract

The reason why cellular mobile telephony systems exist is that they allow frequency reuse. Dynamic allocation algorithms improve the network efficiency and the service quality. Dynamic allocation is closely related to the following instantaneous allocation problem: given a number of channels (frequencies), a cell structure and the number of calls to be accommodated in each cell, find the optimum allocation of channels to cells subject to restrictions concerning the distance of cells, where the same frequency can be reused. In this paper we formulate and solve this problem by showing that it can be reduced to a 0–1 programming problem. Finally we present results, and draw subsequent conclusions.

No abstract

In this paper, we consider the problem of assigning frequencies to mobile terminals in a cellular network. We show that an optimal solution can be obtained by solving a sequence of alternating linear and quadratic maximization programming problems. We address co-channel constraints and adopt as an objective function the maximization of potentially established calls. Our algorithm is fairly general, and does not depend on any special network structure. This study indicates that mathematical programming can be used as an efficient technique for solving the aforementioned problem.

No abstract