Connectivity problem in wireless networks

Dariusz R. Kowalski, Mariusz A. Rokicki

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

Abstract

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
Pages344-358
Number of pages15
DOIs
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

Conference

Conference24th International Symposium on Distributed Computing, DISC 2010
CountryUnited States
CityCambridge, MA
Period9/13/109/15/10

Fingerprint

Wireless Networks
Wireless networks
Connectivity
Assignment
Radio Networks
Polynomials
Polynomial time
Interference
Complexity Measure
Geometric Model
Vertex of a graph
Communication
Placement
Minimise
Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kowalski, D. R., & Rokicki, M. A. (2010). Connectivity problem in wireless networks. In Distributed Computing - 24th International Symposium, DISC 2010, Proceedings (pp. 344-358). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS). https://doi.org/10.1007/978-3-642-15763-9_32

Connectivity problem in wireless networks. / Kowalski, Dariusz R.; Rokicki, Mariusz A.

Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. 2010. p. 344-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS).

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

Kowalski, DR & Rokicki, MA 2010, Connectivity problem in wireless networks. in Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6343 LNCS, pp. 344-358, 24th International Symposium on Distributed Computing, DISC 2010, Cambridge, MA, United States, 9/13/10. https://doi.org/10.1007/978-3-642-15763-9_32
Kowalski DR, Rokicki MA. Connectivity problem in wireless networks. In Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. 2010. p. 344-358. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-15763-9_32
Kowalski, Dariusz R. ; Rokicki, Mariusz A. / Connectivity problem in wireless networks. Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. 2010. pp. 344-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{747ab3912a04498eb781e818051a9525,
title = "Connectivity problem in wireless networks",
abstract = "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].",
author = "Kowalski, {Dariusz R.} and Rokicki, {Mariusz A.}",
year = "2010",
month = "12",
day = "13",
doi = "10.1007/978-3-642-15763-9_32",
language = "English (US)",
isbn = "3642157629",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "344--358",
booktitle = "Distributed Computing - 24th International Symposium, DISC 2010, Proceedings",

}

TY - GEN

T1 - Connectivity problem in wireless networks

AU - Kowalski, Dariusz R.

AU - Rokicki, Mariusz A.

PY - 2010/12/13

Y1 - 2010/12/13

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=78649863855&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78649863855&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15763-9_32

DO - 10.1007/978-3-642-15763-9_32

M3 - Conference contribution

AN - SCOPUS:78649863855

SN - 3642157629

SN - 9783642157622

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 344

EP - 358

BT - Distributed Computing - 24th International Symposium, DISC 2010, Proceedings

ER -