Fault-tolerant power assignment and backbone in wireless networks

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

6 Scopus citations

Abstract

Given a wireless network, we need to assign transmission power to each of the nodes, that will 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. We also address the problem of constructing a connected backbone, for which we present an efficient constant-factor approximation algorithm.

Original languageEnglish
Title of host publicationProceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
PublisherInstitute of Electrical and Electronics Engineers
Pages5-84
Number of pages80
Volume2006
ISBN (Print)0769525202, 9780769525204
DOIs
StatePublished - 1 Jan 2006
Event4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 - Pisa, Italy
Duration: 13 Mar 200617 Mar 2006

Conference

Conference4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Country/TerritoryItaly
CityPisa
Period13/03/0617/03/06

ASJC Scopus subject areas

  • General 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