Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Wireless information networks
Power Consumption in Packet Radio Networks (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
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 Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Minimum Range Assignment Problem on Linear Radio Networks
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Iterated Local Optimization for Minimum Energy Broadcast
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
k-fault resistance in wireless ad-hoc networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
The min-power multicast problems in wireless ad hoc networks: a parameterized view
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Improved algorithm for minimum cost range assignment problem for linear radio networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
Theoretical Computer Science
| Hi-index | 0.00 |
Given a finite set S of points (i.e. the stations of a radio network) on the plane and a positive integer 1 ≤ h ≤ |S| - 1, the 2D MIN h R. ASSIGN. problem consists of assigning transmission ranges to the stations so as to minimize the total power consumption provided that the transmission ranges of the stations ensure the communication between any pair of stations in at most h hops. We provide a lower bound on the total power consumption opth(S) yielded by an optimal range assignment for any instance (S, h) of 2D MIN h R. ASSIGN., for any positive constant h 0. The lower bound is a function of |S|, h and the minimum distance over all the pairs of stations in S. Then, we derive a constructive upper bound for the same problem as a function of |S|, h and the maximum distance over all the pairs of stations in S (i.e. the diameter of S). Finally, by combining the above bounds, we obtain a polynomial-time approximation algorithm for 2D MIN h R. ASSIGN. restricted to well-spread instances, for any positive constant h. Previous results for this problem were known only in special 1-dimensional configurations (i.e. when points are arranged on a line).