Minimizing interference in ad-hoc networks with bounded communication radius

Cozzetti Matias Korman

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

3 Citations (Scopus)

Abstract

We consider a topology control problem in which we are given a set of n sensors in ℝ d and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low receiver-based interference (defined as the largest in-degree of the network). We give an algorithm that generates a network with O(logΔ) interference, where Δ is the interference of a uniform-radius network. Since the radius of each sensor only depends on its neighbors, it can be computed in a distributed fashion. Moreover, this construction will never assign communication radius larger than R min to a sensor, where R min is the minimum value needed to obtain strong connectivity. We also show that Ω(logn) interference is needed for some instances, making our algorithms asymptotically optimal.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
Pages80-89
Number of pages10
DOIs
Publication statusPublished - 2011 Dec 26
Externally publishedYes
Event22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, Japan
Duration: 2011 Dec 52011 Dec 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7074 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other22nd International Symposium on Algorithms and Computation, ISAAC 2011
Country/TerritoryJapan
CityYokohama
Period11/12/511/12/8

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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