Implementation of the maximum packing channel assignment algorithm in cellular networks

The maximum packing algorithm (MPA) is a greedy algorithm, that rejects a call only when it is forced to do so, even if this involves rearrangement of channels assigned to the ongoing calls, without dropping any of them. This paper mainly concentrates on the performance of this algorithm in terms of the total carried traffic. We model the channel reuse constraints in the cellular network by a hypergraph. Previously (1996) we demonstrated the optimality of MPA for low and moderate offered traffic in the system. In this paper, we envisage MPA as a practical channel assignment algorithm, for moderate sized systems, and suggest a good strategy to implement it. We comment on the complexity of the algorithm and suggest approximations to reduce it