Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs

Authors:
Petteri Kaski;Aleksi Penttinen;Jukka Suomela
Affiliations:
Helsinki Institute for Information Technology, Department of Computer Science, University of Helsinki, Finland;Networking Laboratory, Helsinki University of Technology, TKK, Finland;Helsinki Institute for Information Technology, Department of Computer Science, University of Helsinki, Finland
Venue:
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Year:
2007

Citing 15
Cited 0

A note on line digraphs and the directed max-cut problem

Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
On Syntactic versus Computational Views of Approximability

SIAM Journal on Computing
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Approximations of Independent Sets in Graphs

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximate strong separation with application in fractional graph coloring and preemptive scheduling

Theoretical Computer Science
Sequential and Parallel Algorithms for Mixed Packing and Covering

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Wireless Communications

Wireless Communications
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
Networking Wireless Sensors

Networking Wireless Sensors
Impact of interference on multi-hop wireless network performance

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Approximability of identifying codes and locating--dominating codes

Information Processing Letters
Conversion of coloring algorithms into maximum weight independent set algorithms

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the algorithmic problem of coordinating transmissions in a wireless network where radio interference constrains concurrent transmissions on wireless links. We focus on pairwise conflicts between the links; these can be described as a conflict graph. Associated with the conflict graph are two fundamental network coordination tasks: (a) finding a nonconflicting set of links with the maximum total weight, and (b) finding a link schedule with the minimum total length. Our work shows that two assumptions on the geometric structure of conflict graphs suffice to achieve polynomial-time constant-factor approximations: (i) bounded density of devices, and (ii) bounded range of interference. We also show that these assumptions are not sufficient to obtain a polynomial-time approximation scheme for either coordination task.