Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Efficiency and Complexity of Distributed Spectrum Allocation
 

Summary: On the Efficiency and Complexity of Distributed
Spectrum Allocation
Lili Cao and Haitao Zheng
Department of Computer Science
University of California, Santa Barbara, CA 93106 U.S.A
Email: {lilicao,htzheng}@cs.ucsb.edu
Abstract--We study the efficiency and complexity of a distrib-
uted spectrum allocation algorithm using explicit user coordi-
nation. Users self-organize into coordination groups and adjust
spectrum assignments in each local group to approximate an
optimal assignment. Compared to the conventional topology-
based 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.
I. INTRODUCTION

  

Source: Almeroth, Kevin C. - Department of Computer Science, University of California at Santa Barbara

 

Collections: Computer Technologies and Information Sciences