Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
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
Introduction to Algorithms
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
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
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
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
Maximum Lifetime Broadcasting in Wireless Networks
IEEE Transactions on Computers
k-fault resistance in wireless ad-hoc networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
Mobile Networks and Applications
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The temporary and unfixed physical topology of a wireless adhoc network is determined by the distribution of the wireless nodes as well as the transmission power (range) assignment of each node. This paper studies asymmetric power assignments for which the induced communication graph is k-strongly connected, while minimizing the total energy assigned (which is NP-Hard) and maximizing the network lifetime. We show that our power assignment algorithm from [9] achieves a bicriteria approximation of (O(k),O(k log n k√nφ(n))) with high probability for the minimal total cost/maximal network (respectively) lifetime problem in the plane in the case of arbitrary battery charges. The same algorithm is an (O(k),O(1))-approximation in the case of uniform batteries. To the best of our knowledge, this is the first attempt to provide a bicriteria approximation factor for the total power assignment cost and the network lifetime under the k-fault resilience criterion. We provide some results for the linear power assignment algorithm in [30] as well. In addition, we extend the static algorithms above to support dynamic node insert/delete operations in O(log n) time for the linear case and an expected O(k poly log n) amortized time in the plane.