Fault-tolerant power assignment and backbone in wireless networks

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Given a wireless network, we need to assign transmission power to each of the nodes, so as to enable communication between any two nodes (via other nodes). Moreover, due to possible faults, we would like to have at least k vertex-disjoint paths from any node to any other node, where k is some fixed integer, depending on the reliability of the nodes. The goal is to achieve this directed k-connectivity with minimal overall power consumption. The problem is NP-Hard for any k ≥ 1, already for planar networks. Here we develop an O(k)-approximation algorithm for the planar case. Next, we address the problem of constructing a k-connected backbone, for which we present an O(k3)-approximation algorithm.

Original languageEnglish
Pages (from-to)355-366
Number of pages12
JournalAd-Hoc and Sensor Wireless Networks
Volume4
Issue number4
StatePublished - 1 Jan 2007

ASJC Scopus subject areas

  • General Computer Science
  • Instrumentation
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Fault-tolerant power assignment and backbone in wireless networks'. Together they form a unique fingerprint.

Cite this