Sequential packing algorithm for channel assignment under cochannel and adjacent-channel interference constraint

Generally, the channel-assignment problem (CAP) for mobile cellular systems is solved by graph-coloring algorithms. These algorithms, though sometimes can yield an optimal solution, do not supply any information on whether an optimal solution has been found or bow far away it is from the optimum. In view of these undesirable features, two relevant results are presented. First, a lower bound for the minimum number of channels required to satisfy a given call-traffic demand is derived. This lower bound is tighter than the existing ones under certain conditions and can be used as a supplement for other approximate algorithms. Second, we propose an efficient heuristic algorithm to solve this problem. Although the CAP is nondeterministic polynomial (NP) complete in general, our algorithm provides an optimal solution for a special class of network topologies. For the general case, promising results are obtained, and numerical examples show that our algorithm has a better performance than many existing algorithms