Dynamic interference management

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A linear interference network is considered. Long-term fluctuations (shadow fading) in the wireless channel can lead to any link being erased with probability p. Each receiver is interested in one unique message that can be available at M transmitters. In a cellular downlink scenario, the case where M = 1 reflects the cell association problem, and the case where M > 1 reflects the problem of setting up the backhaul links for Coordinated Multi-Point (CoMP) transmission. For M = 1, we characterize the average per user DoF, and identify the optimal assignment of messages to transmitters at each value of p. For general values of M, we show that there is no strategy for assigning messages to transmitters in large networks that is optimal for all values of p.

Original languageEnglish (US)
Title of host publicationConference Record of the 47th Asilomar Conference on Signals, Systems and Computers
PublisherIEEE Computer Society
Pages1902-1906
Number of pages5
ISBN (Print)9781479923908
DOIs
StatePublished - Jan 1 2013
Event2013 47th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 3 2013Nov 6 2013

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other2013 47th Asilomar Conference on Signals, Systems and Computers
Country/TerritoryUnited States
CityPacific Grove, CA
Period11/3/1311/6/13

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Dynamic interference management'. Together they form a unique fingerprint.

Cite this