On minimum-collisions assignment in heterogeneous self-organizing networks

摘要: Minim um-collisions assignment (MCA), in a wireless network, is the distribution of finite resource set, such that number neighbor cells which receive common elements minimized. In classical operator deployed networks, resources are assigned centrally. Heterogeneous networks contain user cells, therefore centralized problematic. MCA includes orthogonal frequency bands, time slots, and physical cell identity (PCI) allocation. NP-complete, potential-game-theoretic model proposed as distributed solution. The players game actions set PCIs cost collision. price anarchy stability derived. Moreover paper adapts randomized-distributed-synchronous-update algorithm, for case, when higher than maximum degree relations graph. It proven algorithm converges to optimal pure strategy Nash equilibrium it robust node addition. Simulation results demonstrate sub-linear size input graph, thus outperforms best response dynamics.