Optimal Partitioning of Cellular Networks:
(Preliminary Results)
The paper has appeared in the Proceedings of IEEE ICC'96.
It is available (in compressed form)
by clicking HERE.
The problem of partitioning a cellular network into several
disjoint parts is central to the design of cellular systems.
The objective is to partition the network of cells into two or more
parts such that the amount of handover between cells that belong
to different parts (or any other cost function) is minimized.
All the cells in each part are assigned to the same MSC.
We present a model and fast algorithms that obtain partitions that
minimize the handover (or any other cost function)
between cells that belong to different MSCs.
The examples included in this page are based on two topologies of
cellular networks. The first type is a regular grid topology
containing 210 cells. The second is an irregular topology containing
23 cells. We have run a prototype of our algorithm (for bipartitions)
assuming "random" handover patterns, and obtained very interesting
results. The ideas can be extended to multipartitions. Here we show a
few examples of the output windows for each topology.
- Large Regular Topology Examples
-
Example 1
-
Example 2
-
Example 3
-
Example 4
-
Example 5
- Smaller Irregular Topology Examples
-
Example 1
-
Example 2
-
Example 3
-
Example 4
-
Example 5