Understanding the Power of Distributed
Coordination for Dynamic Spectrum Management
Lili Cao and Haitao Zheng
Department of Computer Science
University of California, Santa Barbara, CA 93106 U.S.A
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks.
While previous works focus on centralized provisioning, we propose a distributed low complexity approach where nodes self-
organize into coordination groups and adapt their spectrum assignment to approximate the global optimal assignment. We design a
distributed coordination protocol to regulate the coordination format and achieve fast system convergence. The proposed approach
achieves similar performance in spectrum assignment compared to that of the conventional centralized approaches, but significantly
reduces the number of computations and message exchanges required to adapt to topology changes. As a case study, we investigate
the detailed coordination strategy to improve proportional fairness in spectrum assignment, and derive a theoretical lower bound
on the minimum spectrum/througput each node can get from coordination. Such bound can be utilized to guide the coordination
procedures. We also show that the difference between the proposed approach and the global optimal approach is upper-bounded.
Experimental results demonstrate that the proposed approach provides similar performance as the topology-based optimization but
with more than 50% of reduction in complexity.