Centralized and Decentralized Coordinated Scheduling with Muting

We compare the algorithms for centralized and decentralized multi-cell joint optimization of coordinated scheduling with muting. For conventional non-overlapping clusters of cooperating cells, we show that for the same latency of communication, an appropriate decentralized algorithm can equivalently achieve the same jointly optimal solution achieved by a centralized approach. In this decentralized algorithm, cells do not exchange CSIs of all users with other cells, but instead exchange per-cell benefit metrics. In non-overlapping clusters, border cells in a cluster do not coordinate with strong interferers outside the cluster. We introduce a new cluster design called Liquid Cluster which allows a cell to flexibly cooperate with all its relevant interferers. The decentralized algorithm easily extends to Liquid Clusters, performing better than conventional non-overlapping 9-cell clusters.