Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Graph coloring based physical-cell-ID assignment for LTE networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Challenges in mobile network operation: Towards self-optimizing networks
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Artificial Intelligence - Special issue: Distributed constraint satisfaction
IEEE Communications Magazine
Performance of distributed dynamic frequency selection schemes for interference reducing networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Hi-index | 0.00 |
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 to solve these problems in a distributive manner using a graph coloring approach. Algorithms based on real-valued interference pricing of conflicts converge rapidly to a local optimum, whereas algorithms with binary interference pricing have a chance to find a global optimum. We apply both local search algorithms and complete algorithms such as Asynchronous Weak-Commitment Search. For system level performance evaluation, a picocellular scenario is considered, with indoor base stations in office houses placed in a Manhattan grid. We investigate a growing network, where neighbor cell lists are generated using practical measurement and reporting models. Distributed selection of conflict-free primary component carriers is shown to converge with 5 or more component carriers, while distributed assignment of confusionfree physical cell IDs is shown to converge with less than 15 IDs. The results reveal that the use of binary pricing of interference with an attempt to find a global optimum outperforms real-valued pricing.