Distributed graph coloring for self-organization in LTE networks

摘要: Primary Component Carrier Selection and Physical Cell ID Assignment are two important self-configuration problems pertinent to LTE-Advanced. In this work, we investigate the possibility solve these in a distributive manner using graph coloring approach. Algorithms based on real-valued interference pricing of conflicts converge rapidly local optimum, whereas algorithms with binary have chance find global optimum. We apply both search complete such as Asynchronous Weak-Commitment Search. For system level performance evaluation, picocellular scenario is considered, indoor base stations office houses placed Manhattan grid. growing network, where neighbor cell lists generated practical measurement reporting models. Distributed selection conflict-free primary component carriers shown 5 or more carriers, while distributed assignment confusionfree physical IDs less than 15 IDs. The results reveal that use an attempt optimum outperforms pricing.