Batched Point Location in SINR Diagrams via Algebraic Tools

@inproceedings{Aronov2015BatchedPL,
  title={Batched Point Location in SINR Diagrams via Algebraic Tools},
  author={Boris Aronov and Matthew J. Katz},
  booktitle={ICALP},
  year={2015}
}
The SINR model for wireless networks has been extensively studied recently. It tries to model whether a particular transmitter is heard at a specific location, with $n$ transmitting simultaneously. The SINR diagram consists of $n$ regions where each transmitter can be heard and the remaining space where no one can be heard. Efficient point location in the SINR diagram, i.e., building a data structure to determine, for a query point, whether any transmitter is heard there, and if so, which one… 
Batched Point Location in SINR Diagrams via Algebraic Tools
TLDR
Batched point location queries are addressed, i.e., answering many queries simultaneously, and the results demonstrate the (so far underutilized) power of combining algebraic tools with those of computational geometry and other fields.
Resolving SINR Queries in a Dynamic Setting
We consider a set of transmitters broadcasting simultaneously on the same frequency under the SINR model. Transmission power may vary from one transmitter to another, and a transmitter's signal
Nonuniform SINR+Voroni Diagrams Are Effectively Uniform
TLDR
The fundamental properties of the SINR+Voronoi diagram provide a theoretical justification to engineering practices basing zonal tessellations on the Voronoi diagrams, and helps to explain the soundness and efficacy of such practices.
Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing
TLDR
A novel deterministic distributed implementation of token traversal in the SINR model with uniform transmission powers and no restriction on connectivity is shown, showing that it is efficient even in a very harsh model of weakly-connected networks without GPS, carrier sensing and other helping features.
The Topology of Wireless Communication
TLDR
The SINR model, which compares the received power of a signal at a receiver against the sum of strengths of other interfering signals plus background noise, is considered and a striking contrast between d- and (d+1)-dimensional maps for a network embedded in d-dimensional space is exhibited.
Deterministic Digital Clustering of Wireless Ad Hoc Networks
TLDR
The results prove that additional model/environment features may help substantially in design of time-efficient solutions for global communication problems, but not much in case of local problems.
Deterministic Oblivious Local Broadcast in the SINR Model
TLDR
This paper considers an oblivious and semi-oblivious variants of the problem of local Broadcast, where the oblivious algorithm is a fixed deterministic schedule of transmissions that tells each station in which rounds it has to transmit.
Computing Shapley Values for Mean Width in 3-D
TLDR
An algorithm to compute Shapley values in 3-D, where points are treated as players and the mean width of the convex hull as the characteristic function is used.
On the Relations Between SINR Diagrams and Voronoi Diagrams
TLDR
This review considers a fundamental geometric object from each field: SINR diagrams and Voronoi diagrams, which appear in several distinct settings of wireless communication, as well as some algorithmic applications.
...
...

References

SHOWING 1-10 OF 28 REFERENCES
SINR diagram with interference cancellation
A constant-factor approximation for wireless capacity maximization with power control in the SINR model
TLDR
This work presents the first algorithm achieving a constant-factor approximation in fading metrics, and existing approaches work well together with the algorithm allowing it to be used in singlehop and multi-hop scheduling scenarios.
Capacity of Arbitrary Wireless Networks
TLDR
This work proposes the first scheduling algorithm with approximation guarantee independent of the topology of the network, and proves that the analysis of the algorithm is extendable to higher-dimensional Euclidean spaces, and to more realistic bounded-distortion spaces, induced by non-isotropic signal distortions.
Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory
TLDR
It is shown that maximizing the number of supported connections is NP-hard, even when there is no background noise, in contrast to the problem of determining whether or not a given set of connections is feasible since that problem can be solved via linear programming.
Complexity in geometric SINR
TLDR
The first NP-completeness proofs in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane, are presented, which proves two problems to be NP-complete: Scheduling and One-Shot Scheduling.
The Complexity of Connectivity in Wireless Networks
TLDR
This paper presents a novel scheduling algorithm that successfully schedules a strongly connected set of links in time O(logn) even in arbitrary worst-case networks, and proves that the scheduling complexity of connectivity grows only polylogarithmically in the number of nodes.
Wireless scheduling with power control
TLDR
Improved approximation is obtained for a bidirectional variant of the scheduling problem, partial answers are given to questions about the utility of graphs for modeling physical interference, and generalize the setting from the standard 2-dimensional Euclidean plane to doubling metrics.
Wireless capacity with oblivious power in general metrics
TLDR
It is shown that the mean power assignment is optimal for capacity maximization of bi-directional links, and a tight θ(log n)-approximation of scheduling bi- Directional links with power control using oblivious power is given.
The capacity of wireless networks
When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for
Maximum Independent Set of Links under Physical Interference Model
TLDR
This paper develops a new approximation algorithm with constant approximation bound regardless of the value of the background noise, which is significantly smaller than all the known bounds which are only valid under certain special assumptions.
...
...