Heuristic cell partitioning scheme based on min-cut scheme incellular networks

摘要

The concept of min-cut is central to the partitioning problem, ascheme so as to minimize the number of edges between any two areas.Based on this concept, we propose a heuristic cell partitioning schemeto minimize overhead when the mobile host crosses from one cell toanother in a cellular networks. In this study, we expand to the schemeadapted for cellular networks from the min-cut concept, and formulateobjective functions so as to minimize partitioning. Also, we presenttest results of the proposed scheme