An Optimization Model for Non-Regular Channel Assignment in Wireless Communications Network

In this paper we develop a mathematical programming model to solve the channel assignment problem for a collection of cells of arbitrary shape, size, and traffic loads. In this problem, which is known as the non-regular channel assignment problem, we seek the optimal partitioning of the available radio frequencies into non-overlapping sets, the optimal groupings of co-user cells, and the best assignment of the former to the latter. The objective is the maximization of traffic handling capacity which, given the multitude of cells, is expressed as the maximization of the bottleneck capacity ratio. The capacity ratio for a cell is the ratio of the number of radio frequencies assigned to the cell over the number of radio frequencies needed to meet blocking probability requirements.