A graph-based approach for distributed parameter coordination in wireless communication networks

摘要: This paper addresses distributed parameters coordination methods for wireless communication systems founded on message-passing algorithms graphs. work provides evaluations the potential of such an approach in a network, and compares its performance convergence properties with those baseline selfish/greedy approach. Simulation results example application, i.e. frequency reuse planning, is presented discussed. The show that graph-based techniques generally have higher probability reaching (near) optimal solution than greedy approach, though rate tends to be slower message size typically larger. Methods improving reducing associated are therefore important topics future studies.