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 language | English |
---|---|
Title of host publication | Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 5-84 |
Number of pages | 80 |
Volume | 2006 |
ISBN (Print) | 0769525202, 9780769525204 |
DOIs | |
State | Published - 1 Jan 2006 |
Event | 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 - Pisa, Italy Duration: 13 Mar 2006 → 17 Mar 2006 |
Conference
Conference | 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 |
---|---|
Country/Territory | Italy |
City | Pisa |
Period | 13/03/06 → 17/03/06 |
ASJC Scopus subject areas
- General Engineering