Multi-channel assignment for communication in radio networks

Dariusz R. Kowalski, Mariusz A. Rokicki

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

Abstract

We study three communication primitives in wireless radio networks: Connectivity, One-Receiver, and Gossiping. Radio networks are modeled by undirected graphs of general topology. We consider centralized solutions to the abovementioned problems. In Connectivity and One-Receiver problems, we study the impact of multi-channel assignment to the hardness and approximation of computing of assignments with the minimum number of channels. More precisely, we show that both Connectivity and One-Reciver are Ω(logn)-inapproximable, unless NP ⊂ DTIME(nlog log n). We also give polynomial time algorithms computing multi-channel assignments using at most 3(Δ + ln 2 n) channels for connectivity and at most Δ channels for one-receiver problem, where n is the number of nodes and Δ is the maximum node degree in the graph. Finally, in case of the classical gossiping problem, related to the connectivity problem, we show that it is NP-complete.

Original languageEnglish (US)
Title of host publicationTheory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings
Pages181-192
Number of pages12
DOIs
StatePublished - Apr 14 2011
Externally publishedYes
Event1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011 - Rome, Italy
Duration: Apr 18 2011Apr 20 2011

Publication series

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

Conference

Conference1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011
CountryItaly
CityRome
Period4/18/114/20/11

Fingerprint

Channel Assignment
Radio Networks
Connectivity
Networks (circuits)
Communication
Gossiping
Receiver
Hardness
Topology
Polynomials
Network Connectivity
Computing
Vertex of a graph
Undirected Graph
Polynomial-time Algorithm
Wireless Networks
Assignment
NP-complete problem
Approximation
Graph in graph theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kowalski, D. R., & Rokicki, M. A. (2011). Multi-channel assignment for communication in radio networks. In Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings (pp. 181-192). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6595 LNCS). https://doi.org/10.1007/978-3-642-19754-3_19

Multi-channel assignment for communication in radio networks. / Kowalski, Dariusz R.; Rokicki, Mariusz A.

Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings. 2011. p. 181-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6595 LNCS).

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

Kowalski, DR & Rokicki, MA 2011, Multi-channel assignment for communication in radio networks. in Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6595 LNCS, pp. 181-192, 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, Rome, Italy, 4/18/11. https://doi.org/10.1007/978-3-642-19754-3_19
Kowalski DR, Rokicki MA. Multi-channel assignment for communication in radio networks. In Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings. 2011. p. 181-192. (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-19754-3_19
Kowalski, Dariusz R. ; Rokicki, Mariusz A. / Multi-channel assignment for communication in radio networks. Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings. 2011. pp. 181-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0e40bb23d0a54696b797e03e345bf084,
title = "Multi-channel assignment for communication in radio networks",
abstract = "We study three communication primitives in wireless radio networks: Connectivity, One-Receiver, and Gossiping. Radio networks are modeled by undirected graphs of general topology. We consider centralized solutions to the abovementioned problems. In Connectivity and One-Receiver problems, we study the impact of multi-channel assignment to the hardness and approximation of computing of assignments with the minimum number of channels. More precisely, we show that both Connectivity and One-Reciver are Ω(logn)-inapproximable, unless NP ⊂ DTIME(nlog log n). We also give polynomial time algorithms computing multi-channel assignments using at most 3(Δ + ln 2 n) channels for connectivity and at most Δ channels for one-receiver problem, where n is the number of nodes and Δ is the maximum node degree in the graph. Finally, in case of the classical gossiping problem, related to the connectivity problem, we show that it is NP-complete.",
author = "Kowalski, {Dariusz R.} and Rokicki, {Mariusz A.}",
year = "2011",
month = "4",
day = "14",
doi = "10.1007/978-3-642-19754-3_19",
language = "English (US)",
isbn = "9783642197536",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "181--192",
booktitle = "Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings",

}

TY - GEN

T1 - Multi-channel assignment for communication in radio networks

AU - Kowalski, Dariusz R.

AU - Rokicki, Mariusz A.

PY - 2011/4/14

Y1 - 2011/4/14

N2 - We study three communication primitives in wireless radio networks: Connectivity, One-Receiver, and Gossiping. Radio networks are modeled by undirected graphs of general topology. We consider centralized solutions to the abovementioned problems. In Connectivity and One-Receiver problems, we study the impact of multi-channel assignment to the hardness and approximation of computing of assignments with the minimum number of channels. More precisely, we show that both Connectivity and One-Reciver are Ω(logn)-inapproximable, unless NP ⊂ DTIME(nlog log n). We also give polynomial time algorithms computing multi-channel assignments using at most 3(Δ + ln 2 n) channels for connectivity and at most Δ channels for one-receiver problem, where n is the number of nodes and Δ is the maximum node degree in the graph. Finally, in case of the classical gossiping problem, related to the connectivity problem, we show that it is NP-complete.

AB - We study three communication primitives in wireless radio networks: Connectivity, One-Receiver, and Gossiping. Radio networks are modeled by undirected graphs of general topology. We consider centralized solutions to the abovementioned problems. In Connectivity and One-Receiver problems, we study the impact of multi-channel assignment to the hardness and approximation of computing of assignments with the minimum number of channels. More precisely, we show that both Connectivity and One-Reciver are Ω(logn)-inapproximable, unless NP ⊂ DTIME(nlog log n). We also give polynomial time algorithms computing multi-channel assignments using at most 3(Δ + ln 2 n) channels for connectivity and at most Δ channels for one-receiver problem, where n is the number of nodes and Δ is the maximum node degree in the graph. Finally, in case of the classical gossiping problem, related to the connectivity problem, we show that it is NP-complete.

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

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

U2 - 10.1007/978-3-642-19754-3_19

DO - 10.1007/978-3-642-19754-3_19

M3 - Conference contribution

AN - SCOPUS:79953825777

SN - 9783642197536

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

SP - 181

EP - 192

BT - Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Proceedings

ER -