Cellular Channel Assignment: Comparing and Simplifying Heuristics

... We consider a problem that has been previously solved by heuristics, we demonstrate that the search time for the global minimum is O(n log n), and therefore there is no need for search techniques, and that the algorithm can be distributed. We compare the main algorithms by simulating a cellular network with mobile hosts on the well-established hexagonal-cell pattern with a uniform call arrival distribution