GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm

DSpace/Manakin Repository

GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm

Show simple item record

dc.contributor.author Babadi, Behtash
dc.contributor.author Tarokh, Vahid
dc.date.accessioned 2011-01-26T14:47:27Z
dc.date.issued 2010
dc.identifier.citation Babadi, Behtash and Vahid Tarokh. 2010. GADIA: A greedy asynchronous distributed interference avoidance algorithm. IEEE Transactions on Information Theory 56(12): 6228-6252. en_US
dc.identifier.issn 0018-9448 en_US
dc.identifier.uri http://nrs.harvard.edu/urn-3:HUL.InstRepos:4687268
dc.description.abstract In this paper, the problem of distributed dynamic frequency allocation is considered for a canonical communication network, which spans several networks such as cognitive radio networks and digital subscriber lines (DSLs). A greedy asynchronous distributed interference avoidance (GADIA) algorithm for horizontal spectrum sharing has been proposed that achieves performance close to that of a centralized optimal algorithm. The convergence of the GADIA algorithm to a near-optimal frequency allocation strategy is proved and several asymptotic performance bounds have been established for various spatial configurations of the network nodes. Furthermore, the near-equilibrium dynamics of the GADIA algorithm has been studied using the Glauber dynamics, by identifying the problem with the antiferromagnetic inhomogeneous long-range Potts model. Using the near-equilibrium dynamics and methods from stochastic analysis, the robustness of the algorithm with respect to time variations in the activity of network nodes is studied. These analytic results along with simulation studies reveal that the performance is close to that of an optimum centralized frequency allocation algorithm. Further simulation studies confirm that our proposed algorithm outperforms the iterative water-filling algorithm in the low signal-to-interference-plus-noise ratio (SINR) regime, in terms of achieved sum rate, complexity, convergence rate, and robustness to time-varying node activities. en_US
dc.description.sponsorship Engineering and Applied Sciences en_US
dc.language.iso en_US en_US
dc.publisher Institute of Electrical and Electronics Engineers en_US
dc.relation.isversionof doi:10.1109/TIT.2010.2081090 en_US
dash.license OAP
dc.subject cognitive radios en_US
dc.subject distributed algorithms en_US
dc.subject dynamic spectrum allocation en_US
dc.subject Glauber dynamics en_US
dc.subject interference avoidance en_US
dc.title GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm en_US
dc.type Journal Article en_US
dc.description.version Accepted Manuscript en_US
dc.relation.journal IEEE Transactions on Information Theory en_US
dash.depositing.author Babadi, Behtash
dc.date.available 2011-01-26T14:47:27Z

Files in this item

Files Size Format View
it_gadia_2010.pdf 535.9Kb PDF View/Open

This item appears in the following Collection(s)

  • FAS Scholarly Articles [6948]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University

Show simple item record

 
 

Search DASH


Advanced Search
 
 

Submitters