Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Discrete Mathematics - Topics on domination
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science
Wireless information networks
Mobile and wireless networks
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
The capacity of wireless networks
IEEE Transactions on Information Theory
Structure and algorithms in the SINR wireless model
ACM SIGACT News
A model for interference on links in inter-working multi-hop wireless networks
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
A framework for connectivity in inter-working multi-hop wireless networks
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Algorithms for scheduling with power control in wireless networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
SINR maps: properties and applications
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SINR diagram with interference cancellation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the capacity of oblivious powers
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Framework for link reliability in inter-working multi-hop wireless networks
Mathematical and Computer Modelling: An International Journal
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Theoretical Computer Science
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
Network topology models for multihop wireless networks
ISRN Communications and Networking
Distributed deterministic broadcasting in wireless networks of weak devices
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations in the plane, it is possible to identify a reception zone for each station, consisting of the points where its transmission is received correctly. The resulting SINR diagram partitions the plane into a reception zone per station and the remaining plane where no station can be heard. SINR diagrams appear to be fundamental to understanding the behavior of wireless networks, and may play a key role in the development of suitable algorithms for such networks, analogous perhaps to the role played by Voronoi diagrams in the study of proximity queries and related issues in computational geometry. So far, however, the properties of SINR diagrams have not been studied systematically, and most algorithmic studies in wireless networking rely on simplified graph-based models such as the unit disk graph (UDG) model, which conveniently abstract away interference-related complications, and make it easier to handle algorithmic issues, but consequently fail to capture accurately some important aspects of wireless networks. The current paper focuses on obtaining some basic understanding of SINR diagrams, their properties and their usability in algorithmic applications. Specifically, based on some algebraic properties of the polynomials defining the reception zones we show that assuming uniform power transmissions, the reception zones are convex and relatively well-rounded. These results are then used to develop an efficient approximation algorithm for a fundamental point location problem in wireless networks.