Heuristics for Mult iway Part it ioning in Hexagonal Cellular Systiems
Kyungshik Lim, Young-Hwan Lim, Yann-Hang Lee · 1995
Gi.ven a hexagoinal mesh of base sta- tions in cellular systems we consider the problem of finding a cover of disjoint clusters of base stations which generate multiple types of traffic among them- selves. The objective is to minimize the total com- munication cost for the entire system where inter- cluster communication is more expensive than intra- cluster communication for each type of traffic. We develop several heuristics based on the techniques of moving or interchanging the boundary nodes be- tween adjacent clusters. The heuristics are compared and shown to behave quite well1 through experimen- tal tests and analysis.