Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks

摘要

In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power while maintaining $k$-fault tolerance. Specifically, we require all links established by this power setting be symmetric and form a $k$-vertex connected subgraph of the network graph. This problem is known to be NP-hard. We show current heuristic approaches can use arbitrarily more power than the optimal solution. Hence, we seek approximation algorithms for this problem. We present three approximation algorithms. The first algorithm gives an $O(kalpha )$ -approximation where $alpha $ is the best approximation factor for the related problem in wired networks (the best $alpha $ so far is $O(log k)$ .) With a more careful analysis, we show our second (slightly more complicated) algorithm is an $O(k)$ -approximation. Our third algorithm assumes that the edge lengths of the network graph form a metric. In this case, we present simple and practical distributed algorithms for the cases of 2- and 3-connectivity with constant approximation factors. We generalize this algorithm to obtain an $O(k^{2c+2})$-approximation for general $k$-connectivity ($2leq cleq 4$ is the power attenuation exponent). Finally, we show that these approximation algorithms compare favorably with existing heuristics. We note that all algorithms presented in this paper can be used to minimize power -while maintaining $k$-edge connectivity with guaranteed approximation factors. Recently, different set of authors used the notion of $k$-connectivity and the results of this paper to deal with the fault-tolerance issues for static wireless network settings.