e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Wireless information networks
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Power consumption in packet radio networks
Theoretical Computer Science
The Power Range Assignment Problem in Radio Networks on the Plane
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
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
The Minimum Range Assignment Problem on Linear Radio Networks
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Assign ranges in general ad-hoc networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
| Hi-index | 0.00 |
Ad-hoc wireless networks have no wired infrastructure. Instead, they consist of a collection of radio stations S={1,2,...,n} deployed in a given region and connected by wireless links. Each station is assigned a transmission range, and a station t can correctly receive the transmission of another station s if and only if t is within the range of s. The overall range assignment, r: S→R+, determines a (directed) transmission graph Gr. The transmission range of a station depends on the energy invested by the station. In particular, the power Ps required by a station s to correctly transmit data to another station t must satisfy the inequality $P_s \ge {\tt dist}(s,t)^{\alpha}$, where dist(s,t) is the Euclidean distance between s and t and α≥1 is the distance-power gradient. The value of α may vary from 1 to more than 6 depending on the environment conditions at the location of the network (see [16]).