By Topic

Fault-tolerant power assignment and backbone in wireless networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Carmi, P. ; Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva ; Segal, M. ; Katz, M.J. ; Shpungin, H.

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 ges 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

Published in:

Pervasive Computing and Communications Workshops, 2006. PerCom Workshops 2006. Fourth Annual IEEE International Conference on

Date of Conference:

13-17 March 2006