GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm

DSpace/Manakin Repository

GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm

Citable link to this page

. . . . . .

Title: GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm
Author: Babadi, Behtash; Tarokh, Vahid

Note: Order does not necessarily reflect citation order of authors.

Citation: Babadi, Behtash and Vahid Tarokh. 2010. GADIA: A greedy asynchronous distributed interference avoidance algorithm. IEEE Transactions on Information Theory 56(12): 6228-6252.
Full Text & Related Files:
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.
Published Version: doi:10.1109/TIT.2010.2081090
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4687268

Show full Dublin Core record

This item appears in the following Collection(s)

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

Search DASH


Advanced Search
 
 

Submitters