PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs
Petteri Kaski, Aleksi Penttinen and Jukka Suomela
Ad Hoc & Sensor Wireless Networks: An International Journal Volume 6, Number 3-4, pp. 239-263, 2008. ISSN 1551-9899

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 (PTAS) for either coordination task. There exists a PTAS if we make an additional assumption: (iii) bounded range of radio transmissions.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:4570
Deposited By:Jukka Suomela
Deposited On:13 March 2009