Before revision:  We describe several compact data structures that support approximate SINR queries in the plane in a dynamic context, i.e., where both queries and updates (insertion or deletion of a transmitter)can be performed efficiently} n) and the amortized update time is O(\textrm{polylog} n), while the query time is O(\textrm{polylog} n) for uniform power, and randomized time O(n \mathop{\textrm{polylog}} n) with high probability for non-uniform power.
After revision:  We describe several compact data structures that support approximate SINR queries in the plane in a dynamic context, i.e., where transmitters may be inserted and deleted over time. We distinguish between two main variants --- uniform power and non-uniform power. In both variants the preprocessing time is O(n \mathop{\textrm{polylog} n) and the amortized update time is O(\textrm{polylog} n), while the query time is O(\textrm{polylog} n) for uniform power, and randomized time O(n \mathop{\textrm{polylog}} n) with high probability for non-uniform power.