multi-channel assignment for communication in radio networks

Authors:
Dariusz R. Kowalski;Mariusz A. Rokicki
Affiliations:
University of Liverpool, United Kingdom;University of Liverpool, United Kingdom
Venue:
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Year:
2011

Citing 13
Cited 0

Tree-Based Broadcasting in Multihop Radio Networks

IEEE Transactions on Computers
A lower bound for radio broadcast

Journal of Computer and System Sciences
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Selective families, superimposed codes, and broadcasting on unknown radio networks

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Logarithmic inapproximability of the radio broadcast problem

Journal of Algorithms
Faster communication in known topology radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The worst-case capacity of wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Faster Deterministic Communication in Radio Networks

Algorithmica
Optimal deterministic broadcasting in known topology radio networks

Distributed Computing
Wireless Communication Is in APX

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Connectivity problem in wireless networks

DISC'10 Proceedings of the 24th international conference on Distributed computing

Quantified Score

Hi-index	0.00

Visualization

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 Ω;(log n)-inapproximable, unless NP ⊂ DTIME(nlog log n). We also give polynomial time algorithms computing multi-channel assignments using at most 3(Δ + ln2 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.