Quick Matching for Interference Coordination in Ultra-Dense Networks

Existing algorithms are time consuming for multi-cluster interference coordination in ultra-dense networks. This letter proposes a universal quick matching scheme to tackle this issue in the forms of theorems, indicating that inverse matches achieve the optimum of a single cluster as long as the objective function satisfies some common conditions. With this scheme, an optimization process is not required to reach the optimal coordination. Instead, it only needs to rank several vectors of channel state parameters, which dramatically reduces the time cost.