Research Article
On the Efficiency and Complexity of Distributed Spectrum Allocation
@INPROCEEDINGS{10.1109/CROWNCOM.2007.4549824, author={Lili Cao and Haitao Zheng}, title={On the Efficiency and Complexity of Distributed Spectrum Allocation}, proceedings={2nd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications}, publisher={IEEE}, proceedings_a={CROWNCOM}, year={2008}, month={6}, keywords={Algorithm design and analysis Cognitive radio Collaboration Computer science Convergence Interference Network topology Performance analysis Upper bound WiMAX}, doi={10.1109/CROWNCOM.2007.4549824} }- Lili Cao
Haitao Zheng
Year: 2008
On the Efficiency and Complexity of Distributed Spectrum Allocation
CROWNCOM
IEEE
DOI: 10.1109/CROWNCOM.2007.4549824
Abstract
We study the efficiency and complexity of a distributed spectrum allocation algorithm using explicit user coordination. Users self-organize into coordination groups and adjust spectrum assignments in each local group to approximate an optimal assignment. Compared to the conventional topologybased optimizations, local coordination can significantly reduce the computation and communication overhead required to adapt to topology variations. We focus on analyzing the end-user performance in terms of spectrum efficiency and communication overhead. We derive a theoretical lower bound on the amount of spectrum each user can get from coordination, and a theoretical upper bound on the algorithm convergence time.We also perform experiments to verify our analytical results.