Interference avoidance in networks with distributed receivers

  • Authors:
  • R. Menon;A. B. MacKenzie;R. M. Buehrer;J. H. Reed

  • Affiliations:
  • Tyco Electronics, Lynchburg, VA;Wireless@Virginia Tech, Virginia Tech, Blacksburg, VA;Wireless@Virginia Tech, Virginia Tech, Blacksburg, VA;Wireless@Virginia Tech, Virginia Tech, Blacksburg, VA

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Direct extensions of distributed greedy interference avoidance (IA) techniques developed for centralized networks to networks with multiple distributed receivers (as in ad hoc networks) are not guaranteed to converge. Motivated by this fact, we develop a waveform adaptation (WA) algorithm framework for IA based on potential game theory. The potential game model ensures the convergence of the designed algorithms in distributed networks and leads to desirable network solutions. Properties of the game model are then exploited to design distributed implementations of the algorithm that involve limited feedback in the network. Finally, variations of IA algorithms including IA with respect to legacy systems and IA with combined transmit-power and WA adaptations are investigated.