Minimizing interference in ad hoc networks with bounded communication radius

Matias Korman

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

We consider a topology control problem in which we are given a set of sensors in R d and we would like to assign a communication radius to each of them so that they generate a connected network and have low receiver-based interference (defined as the largest in-degree of the network). We show that any radii assignment that generates a connected network can be modified so that interference is (asymptotically) unaffected and no sensor is assigned communication radius larger than R min, where R min is the smallest possible radius needed to obtain strong connectivity. Combining this result with the previous network construction methods (see Halldórsson and Tokuyama (2008) [7] and von Rickenbach et al. (2009) [11]), we obtain a way to construct a connected network of low interference and bounded radii. Since the radius of a sensor is only affected by neighboring sensors, this construction can be done in a distributed fashion.

Original languageEnglish
Pages (from-to)748-752
Number of pages5
JournalInformation Processing Letters
Volume112
Issue number19
DOIs
Publication statusPublished - 2012 Oct 15
Externally publishedYes

Keywords

  • Ad hoc networks
  • Algorithms
  • Bucketing
  • Interference
  • Minimum spanning tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Minimizing interference in ad hoc networks with bounded communication radius'. Together they form a unique fingerprint.

Cite this