Approximating minimum-power k-connectivity

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Minimum-Power k -Connected Subgraph (MP k CS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (sub)network is k-connected and the total power is minimum. We give a new very simple approximation algorithm for this problem that significantly improves the previously best known approximation ratios. Specifically, the approximation ratios of our algorithm are: 3 (improving (3 + 2/3)) for k = 2, 4 (improving (5 + 2/3)) for k = 3, k + 3 for k ∈ {4,5} and k + 5 for k ∈ {6,7} (improving k+2⌈(k+1)/2⌈), 3(k-1) (improving 3k) for any constant k. Our results are based on a (k+1)-approximation algorithm (improving the ratio k+4) for the problem of finding a Min-Power k -Inconnected Subgraph, which is of independent interest.

Original languageEnglish
Title of host publicationAd-hoc, Mobile and Wireless Networks - 7th International Conference, ADHOC-NOW 2008, Proceedings
Pages86-93
Number of pages8
DOIs
StatePublished - 2008
Event7th International Conference on Ad-hoc, Mobile and Wireless Networks, ADHOC-NOW 2008 - Sophia-Antipolis, France
Duration: 10 Sep 200812 Sep 2008

Publication series

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

Conference

Conference7th International Conference on Ad-hoc, Mobile and Wireless Networks, ADHOC-NOW 2008
Country/TerritoryFrance
CitySophia-Antipolis
Period10/09/0812/09/08

Fingerprint

Dive into the research topics of 'Approximating minimum-power k-connectivity'. Together they form a unique fingerprint.

Cite this