Investigation on GADIA Algorithms for Interference Avoidance: A Game-Theoretic Perspective

Author

Wu, Qihui ; Xu, Yuhua ; Shen, Liang ; Wang, Jinlong

Author_Institution

Inst. of Commun. Eng., PLA Univ. of Sci. & Technol., Nanjing, China

Volume

16

Issue

7

fYear

2012

fDate

7/1/2012 12:00:00 AM

Firstpage

1041

Lastpage

1043

Abstract

In a recent paper (B. Babadi and V. Tarokh, "GADIA: A greedy asynchronous distributed interference avoidance algorithm", IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6228-6252, 2010), two asynchronous distributed spectrum allocation algorithms, called the basic GADIA and the soft GADIA respectively, were proposed to solve the problem of interference avoidance for a canonical class of communication networks. The methodology proposed therein is constructive. In this letter, we re-investigate this problem from a game-theoretic perspective, and obtain some key incremental results in favor of the original paper.

Keywords

game theory; interference suppression; telecommunication networks; asynchronous distributed spectrum allocation algorithms; basic GADIA; communication networks; game-theoretic perspective; greedy asynchronous distributed interference avoidance algorithm; soft GADIA; Algorithm design and analysis; Game theory; Games; Heuristic algorithms; Interference; Resource management; Signal processing algorithms; Distributed interference avoidance; best response dynamic; potential game; spatial adaptive play;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2012.051512.120357

Filename

6203462