SINR diagram with interference cancellation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 502-515

  Avin, Chen ^a   Cohen, Asaf ^a   Haddad, Yoram ^a,b   Kantor, Erez ^c   Lotker, Zvi ^a   Parter, Merav ^d   Peleg, David ^d  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b JERUSALEM COLLEGE OF TECHNOLOGY   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; INTEGRATED CIRCUITS; POLYNOMIAL APPROXIMATION; QUERY PROCESSING; SIGNAL RECEIVERS; SPURIOUS SIGNAL NOISE; TOPOLOGY;

COMPUTATIONAL ISSUES; GEOMETRIC OBJECTS; INTERFERENCE CANCELLATION; INTERFERING SIGNALS; LOGARITHMIC TIME; POLYNOMIAL-TIME ALGORITHMS; RECEIVED SIGNALS; TOPOLOGICAL PROPERTIES;

SIGNAL INTERFERENCE;

EID: 84860186709     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.43     Document Type: Conference Paper

References (22)

1. J.G. Andrews. Interference cancellation for cellular systems: a contemporary overview. Wireless Communications, IEEE, 12(2):19-29, April 2005. (Pubitemid 40683422)
2. M. Andrews and M. Dinitz. Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In Proc. 28th Conf. IEEE Computer and Communications Soc. (INFOCOM), 2009.
3. C. Avin, Y. Emek, E. Kantor, Z. Lotker, D. Peleg, and L. Roditty. SINR diagrams: Towards algorithmically usable SINR models of wireless networks. In Proc. 28th Symp. on Principles of Distrib. Computing, 2009. Full version available at http://www.bgu.ac.il/~avin/papers/sinr-full.pdf.
4. C. Avin, Z. Lotker, and Y.-A. Pignolet. On the power of uniform power: Capacity of wireless networks with bounded resources. In ESA, pages 373-384, 2009.
5. J.W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. In Proc. ACM SIGCOMM'98, pages 56-67, 1998.
6. M. Costa and A. El-Gamal. The capacity region of the discrete memoryless interference channel with strong interference. IEEE Trans. Inf. Th., 33:710-711, 1987. (Pubitemid 18568153)
7. T. Cover and J. Thomas. Elements of Information Theory. Wiley, NY, 1991.
8. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
9. R.H. Etkin, D.N.C. Tse, and H. Wang. Gaussian interference channel capacity to within one bit. IEEE Trans. Inf. Th., 54(12):5534-5562, 2008.
10. O. Goussevskaia, R. Wattenhofer, M.M. Halldórsson, and E. Welzl. Capacity of arbitrary wireless networks. In INFOCOM, pages 1872-1880, 2009.
11. P. Gupta and P.R. Kumar. The capacity of wireless networks. IEEE Trans. Inf. Th., 46(2):388-404, 2000.
12. M.M. Halldórsson and R. Wattenhofer. Wireless communication is in APX. In ICALP, pages 525-536, 2009.
13. E. Kantor, Z. Lotker, M. Parter, and D. Peleg. The topology of wireless communication. In STOC, 2011.
14. T. Moscibroda. The worst-case capacity of wireless sensor networks. In Proc. 6th Int. Conf. on Info. Process. in Sensor Networks (IPSN), pages 1-10, 2007.
15. T. Moscibroda and R. Wattenhofer. The complexity of connectivity in wireless networks. In Proc. 25th INFOCOM, 2006.
16. T. Moscibroda, R. Wattenhofer, and Y. Weber. Protocol design beyond graph-based models. In Proc. 5th Workshop on Hot Topics in Networks (Hotnets), 2006.
17. A. Okabe, B. Boots, K. Sugihara, and S.-N. Chiu. Spatial Tesselations. Princeton University Press, 1992.
18. A. Ozgur, O. Leveque, and D. Tse. Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks. IEEE Trans. Inf. Th., 53:3549-3572, 2007. (Pubitemid 47534513)
19. H. Sato. The capacity of the Gaussian interference channel under strong interference (corresp.). IEEE Trans. Inf. Th., 27(6):786-788, 1981. (Pubitemid 12447680)
20. M. Ian Shamos and D. Hoey. Closest-point problems. In FOCS, 1975.
21. L.N. Trefethen and D. Bau. Numerical linear algebra. SIAM, 1997.
22. A.J. Viterbi. Very low rate convolution codes for maximum theoretical performance of spread-spectrum multiple-access channels. Selected Areas in Communications, IEEE J., 8(4):641-649, 1990.