Distributed coordination of spectrum and the prisoner's dilemma

Amir Laufer*, Amir Leshem

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

41 Scopus citations

Abstract

In this paper we discuss distributed spectrum allocation techniques in interference limited environment. We analyze the well known iterative water-filling strategy for a simplified two players interference game, and provide closed form analysis of the cases in which the IWF is suboptimal due to the occurrence of the well known prisoner's dilemma. We then propose some alternative distributed coordination algorithm and show its superiority over IWF for real wireline access network.

Original languageAmerican English
Title of host publication2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005
Pages94-100
Number of pages7
DOIs
StatePublished - 2005
Externally publishedYes
Event2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005 - Baltimore, MD, United States
Duration: 8 Nov 200511 Nov 2005

Publication series

Name2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005

Conference

Conference2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005
Country/TerritoryUnited States
CityBaltimore, MD
Period8/11/0511/11/05

Fingerprint

Dive into the research topics of 'Distributed coordination of spectrum and the prisoner's dilemma'. Together they form a unique fingerprint.

Cite this