Skip to main content

GADIA: A greedy asynchronous distributed interference avoidance algorithm

Publication ,  Journal Article
Babadi, B; Tarokh, V
Published in: IEEE Transactions on Information Theory
December 1, 2010

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. © 2006 IEEE.

Duke Scholars

Published In

IEEE Transactions on Information Theory

DOI

ISSN

0018-9448

Publication Date

December 1, 2010

Volume

56

Issue

12

Start / End Page

6228 / 6252

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Babadi, B., & Tarokh, V. (2010). GADIA: A greedy asynchronous distributed interference avoidance algorithm. IEEE Transactions on Information Theory, 56(12), 6228–6252. https://doi.org/10.1109/TIT.2010.2081090
Babadi, B., and V. Tarokh. “GADIA: A greedy asynchronous distributed interference avoidance algorithm.” IEEE Transactions on Information Theory 56, no. 12 (December 1, 2010): 6228–52. https://doi.org/10.1109/TIT.2010.2081090.
Babadi B, Tarokh V. GADIA: A greedy asynchronous distributed interference avoidance algorithm. IEEE Transactions on Information Theory. 2010 Dec 1;56(12):6228–52.
Babadi, B., and V. Tarokh. “GADIA: A greedy asynchronous distributed interference avoidance algorithm.” IEEE Transactions on Information Theory, vol. 56, no. 12, Dec. 2010, pp. 6228–52. Scopus, doi:10.1109/TIT.2010.2081090.
Babadi B, Tarokh V. GADIA: A greedy asynchronous distributed interference avoidance algorithm. IEEE Transactions on Information Theory. 2010 Dec 1;56(12):6228–6252.

Published In

IEEE Transactions on Information Theory

DOI

ISSN

0018-9448

Publication Date

December 1, 2010

Volume

56

Issue

12

Start / End Page

6228 / 6252

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing