SINR diagrams: Towards algorithmically usable SINR models of wireless networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 200-209

  Avin, Chen ^a   Emek, Yuval ^b   Kantor, Erez ^c   Lotker, Zvi ^a   Peleg, David ^c   Roditty, Liam ^d  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d BAR ILAN UNIVERSITY   (Israel)

Author keywords

Reception zone; SINR; Wireless networks

Indexed keywords

ALGEBRAIC PROPERTIES; ALGORITHMIC APPLICATIONS; ALGORITHMIC ISSUES; EFFICIENT APPROXIMATION ALGORITHMS; GRAPH-BASED MODELS; NOISE RATIO; PHYSICAL MODEL; POINT LOCATION PROBLEMS; PROXIMITY QUERIES; RECEPTION ZONE; SIGNAL TO INTERFERENCES; SINR; UNIT DISK GRAPHS; VORONOI DIAGRAMS; WIRELESS NETWORKING;

APPROXIMATION ALGORITHMS; COMPUTATIONAL EFFICIENCY; COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS; MODELS; SIGNAL TO NOISE RATIO; TRANSMISSIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS NETWORKS;

EID: 70350647285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582750     Document Type: Conference Paper

References (16)

1. P.K. Agarwal and J. Erickson. Geometric range searching and its relatives. In Advances in Discrete and Computational Geometry, pages 1-56. American Mathematical Society, 1999.
2. A. Aggarwal, M. Hansen, and F.T. Leighton. Solving query-retrieval problems by compacting voronoi diagrams. In STOC, pages 331-340, 1990.
3. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, 2003.
4. U. Black. Mobile and Wireless Networks. Prentice Hall, 1996.
5. B. Chazelle, H. Edelsbrunner, L.J. Guibas, and M. Sharir. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theor. Comput. Sci., 84:77-105, 1991.
6. B.N. Clark, C.J. Colbourn, and D.S. Johnson. Unit disk graphs. Discrete Math., 86:165-177, 1990.
7. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2008.
8. O. Goussevskaia, Y.A. Oswald, and R. Wattenhofer. Complexity in geometric SINR. In Proc. 8th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), pages 100-109, 2007.
9. P. Gupta and P.R. Kumar. The capacity of wireless networks. IEEE Trans. Information Theory, 46(2):388-404, 2000.
10. F. Kuhn, R. Wattenhofer, and A. Zollinger. Ad-Hoc Networks Beyond Unit Disk Graphs. In 1st ACM Workshop on Foundations of Mobile Computing (DIALM-POMC), 2003.
11. T. Moscibroda. The worst-case capacity of wireless sensor networks. In Proc. 6th Int. Conf. on Information Processing in Sensor Networks (IPSN), pages 1-10, 2007.
12. T. Moscibroda, R. Wattenhofer, and Y. Weber. Protocol design beyond graph-based models. In Proc. 5th Workshop on Hot Topics in Networks (Hotnets), 2006.
13. T. Moscibroda, R. Wattenhofer, and A. Zollinger. Topology control meets SINR: the scheduling complexity of arbitrary topologies. In Proc. 7th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), pages 310-321, 2006.
14. K. Pahlavan and A. Levesque. Wireless information networks. Wiley, 1995.
15. T. S. Rappaport. Wireless Communications-Principles and Practice. Prentice Hall, 1996.
16. P. von Rickenbach, S. Schmid, R. Wattenhofer, and A. Zollinger. A robust interference model for wireless ad-hoc networks. In Proc. 19th Int. Parallel and Distributed Processing Symp., 2005.