Wireless information networks
Power consumption in packet radio networks
Theoretical Computer Science
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Improved approximation results for the minimum energy broadcasting problem
Proceedings of the 2004 joint workshop on Foundations of mobile computing
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
k-fault resistance in wireless ad-hoc networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Fault-Tolerant Power Assignment and Backbone in Wireless Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
On construction of minimum energy k-fault resistant topologies
Ad Hoc Networks
Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
This paper studies asymmetric power assignments in wireless ad hoc networks. The temporary, unfixed physical topology of wireless ad hoc networks is determined by the distribution of the wireless nodes as well as the transmission power (range) assignment of each node. We consider the problem of bounded-hop broadcast under k-fault resilience criterion for linear and planar layout of nodes. The topology that results from our power assignment allows a broadcast operation from a wireless node r to any other node in at most h hops and is k-fault resistant. We develop simple approximation algorithms for the two cases and obtain the following approximation ratios: linear case--O(k); planar case--we first prove a factor of O(k3), which is later decreased toO(k2) by a finer analysis. Finally, we show a trivial power assignment with a cost O(h) times the optimum. To the best of our knowledge, these are the first nontrivial results for this problem.