Wireless information networks
Performance guarantees for the TSP with a parameterized triangle inequality
Information Processing Letters
Power consumption in packet radio networks
Theoretical Computer Science
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Geometric Applications Of Posets
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
On the node-scheduling approach to topology control in ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
Given a wireless network, we want to assign each node a transmission power, which will enable transmission between any two nodes (via other nodes). Moreover, due to possible faults, we want to have at least k vertex-disjoint paths from any node to any other, where k is some fixed integer, depending on the reliability of the nodes. The goal is to achieve this directed k-strong connectivity with a minimal overall power assignment. The problem is NP-Hard for any k 驴 1 already for planar networks. Here we first present an optimal power assignment for uniformly spaced nodes on a line for any k 驴 1. We also prove a number of useful properties of power assignment which are also of independent interest. Based on it, we design an approximation algorithm for linear radio networks with factor $$\hbox{min}\left\{2,\left(\frac {\Updelta} {\delta}\right)^\alpha \right\},$$ where Δ and 驴 are the maximal and minimal distances between adjacent nodes respectively and parameter 驴 驴 1 being the distance-power gradient. We then extend it to the weighted version. Finally, we develop an approximation algorithm with factor O(k 2), for planar case, which is, to the best of our knowledge, the first non-trivial result for this problem.