Connectivity problem in wireless networks

Dariusz R. Kowalski, Mariusz A. Rokicki

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

11 Scopus citations


We study the complexity of the following connectivity problem in wireless networks: for a given placement of n nodes in the plane, the goal is to compute a channel and power assignment that forms strongly connected communication structure spanning all nodes. The complexity measure is the total number of assigned channels, and the goal is to minimize this number. We work with two signal inference models: Geometric Radio Networks (GRN) and Signal to Interference Plus Noise Ratio (SINR). We show a generic polynomial-time transformation from the wide class of separable assignments in GRN to assignments in the SIRN model. This transformation preserves asymptotic complexity, i.e., the number of channels used in the assignments. In this way we show an assignment, constructed in polynomial-time, guarantying connectivity in the SINR model by using only O(log n) channels, which is an improvement over the best previous result O(log2 n) presented in [21].

Original languageEnglish (US)
Title of host publicationDistributed Computing - 24th International Symposium, DISC 2010, Proceedings
Number of pages15
StatePublished - Dec 13 2010
Externally publishedYes
Event24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States
Duration: Sep 13 2010Sep 15 2010

Publication series

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


Conference24th International Symposium on Distributed Computing, DISC 2010
Country/TerritoryUnited States
CityCambridge, MA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Connectivity problem in wireless networks'. Together they form a unique fingerprint.

Cite this