This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)
Fault-Tolerant Power Assignment and Backbone in Wireless Networks
Pisa, Italy
March 13-March 17
ISBN: 0-7695-2520-2
ASCII Text
x 
 
Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungi, "Fault-Tolerant Power Assignment and Backbone in Wireless Networks," Pervasive Computing and Communications Workshops, IEEE International Conference on, pp. 80-84, Fourth IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PERCOMW.2006.55,
author = {Paz Carmi and Michael Segal and Matthew J. Katz and Hanan Shpungi},
title = {Fault-Tolerant Power Assignment and Backbone in Wireless Networks},
journal ={Pervasive Computing and Communications Workshops, IEEE International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2520-2},
pages = {80-84},
doi = {http://doi.ieeecomputersociety.org/10.1109/PERCOMW.2006.55},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Pervasive Computing and Communications Workshops, IEEE International Conference on
TI - Fault-Tolerant Power Assignment and Backbone in Wireless Networks
SN - 0-7695-2520-2
SP80
EP84
A1 - Paz Carmi,
A1 - Michael Segal,
A1 - Matthew J. Katz,
A1 - Hanan Shpungi,
PY - 2006
VL - 0
JA - Pervasive Computing and Communications Workshops, IEEE International Conference on
ER -
 
Paz Carmi, Ben-Gurion University of the Negev, Israel
Michael Segal, Ben-Gurion University of the Negev, Israel
Matthew J. Katz, Ben-Gurion University of the Negev, Israel
Hanan Shpungi, Ben-Gurion University of the Negev, Israel
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 kconnectivity with minimal overall power consumption. The problem is NP-Hard for any k \geqslant 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.
Citation:
Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungi, "Fault-Tolerant Power Assignment and Backbone in Wireless Networks," percomw, pp.80-84, Fourth IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.