Abstract
This paper studies asymmetric power assignments for various network topologies under the k-resilience criterion. We
aim to minimize the total energy consumption, which is usually NP-Hard for a desired link topology. We develop a general approximation framework for various topology problems
under the k-fault resilience criterion in the plane. We use it
to obtain an O(k2) approximation ratio for three k-fault tolerant topology problems: multicast, broadcast and convergecast. In addition, we consider the problem of k-fault tolerant bounded-hop broadcast. We derive an O(k3) approximation factor for this problem. To the best of our knowledge, these are the first non-trivial results for these problems
aim to minimize the total energy consumption, which is usually NP-Hard for a desired link topology. We develop a general approximation framework for various topology problems
under the k-fault resilience criterion in the plane. We use it
to obtain an O(k2) approximation ratio for three k-fault tolerant topology problems: multicast, broadcast and convergecast. In addition, we consider the problem of k-fault tolerant bounded-hop broadcast. We derive an O(k3) approximation factor for this problem. To the best of our knowledge, these are the first non-trivial results for these problems
| Original language | English |
|---|---|
| State | Published - 1 Jan 2007 |
| Event | Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing - Portland, United States Duration: 16 Aug 2007 → 19 Aug 2007 |
Conference
| Conference | Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing |
|---|---|
| Country/Territory | United States |
| City | Portland |
| Period | 16/08/07 → 19/08/07 |
