Zvi Lotker
Skip Abstract Section
Abstract
The signal-to-interference & noise ratio (SINR) model is one of the most commonly studied physical (or fading channel) models for wireless networks. We survey some recent studies aiming at achieving a better understanding of the SINR model and its structural properties and developing efficient design algorithms and communication protocols for it.
- M. Andrews and M. Dinitz. Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In Proc. 28th Conf. of IEEE Computer and Communications Societies (INFOCOM), 2009.Google Scholar
Cross Ref
- 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 ACM Symp. on Principles of Distributed Computing (PODC), pages 200--209, 2009. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- D. Chafekar, V.S.A. Kumar, M. Marathe, S. Pathasarathy, and A. Srinivasan. Cross-layer latency minimization in wireless networks with SINR constraints. In Proc. 8th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2007. Google ScholarDigital Library
- B.N. Clark, C.J. Colbourn, and D.S. Johnson. Unit disk graphs. Discrete Math., 86:165--177, 1990. Google ScholarDigital Library
- M. Dinitz. Distributed algorithms for approximating wireless network capacity. In Proc. 29th Conf. of IEEE Computer and Communications Societies (INFOCOM), 2010. Google ScholarDigital Library
- A. Fanghänel, T. Kesselheim, H. Räcke, and B. Vöcking. Oblivious interference scheduling. In Proc. 28th ACM Symp. on Principles of distributed computing (PODC), pages 220--229, 2009. Google ScholarDigital Library
- A. Fanghänel, T. Kesselheim, and B. Vöcking. Improved algorithms for latency minimization in wireless networks. In Proc. 36th Int. Colloq. on Automata, Languages and Programming (ICALP), pages 447--458. SV, 2009. Google ScholarDigital Library
- A. Goldsmith. Wireless communications. Cambridge University Press, 2005. Google ScholarDigital Library
- O. Goussevskaia. Computational Complexity and Scheduling Algorithms for Wireless Networks. PhD thesis, ETH Zurich, 2009.Google Scholar
- 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. Google ScholarDigital Library
- P. Gupta and P.R. Kumar. The capacity of wireless networks. IEEE Trans. Information Theory, 46:388--404, 2000. Google ScholarDigital Library
- Magnús M. Halldŗrsson. Wireless scheduling with power control. In Proc. 17th European Symp. on Algorithms (ESA), pages 361--372, 2009.Google ScholarCross Ref
- M.L. Huson and A. Sen. Broadcast scheduling algorithms for radio networks. In IEEE Military Communications Conf. (MILCOM), pages 647--651, 1995.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- E. Lebhar and Z. Lotker. Unit disk graph and physical interference model: Putting pieces together. In 23rd IEEE Int. Symp. on Parallel and Distributed Processing (IPDPS), 2009. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- T. Moscibroda, Y.A. Oswald, and R. Wattenhofer. How optimal are wireless scheduling protocols? In Proc. 26th Conf. of IEEE Computer and Communications Societies (INFOCOM), 2007.Google ScholarDigital Library
- T. Moscibroda and R.Wattenhofer. The complexity of connectivity in wireless networks. In Proc. 25th Conf. of IEEE Computer and Communications Societies (INFOCOM), 2006.Google ScholarCross Ref
- T. Moscibroda, R. Wattenhofer, and Y. Weber. Protocol design beyond graph-based models. In Proc. 5th Workshop on Hot Topics in Networks (Hotnets), 2006.Google Scholar
- 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. Google ScholarDigital Library
- M. Parter and D. Peleg. Bounding the power-to-spread ratio in SINR wireless networks. Unpublished manuscript, 2010.Google Scholar
- Y.-A. Pignolet. Algorithmic Challenges in Wireless Networks Interference, Energy and Incentives. PhD thesis, ETH Zurich, 2009.Google Scholar
- 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. (IPDPS), 2005. Google ScholarDigital Library
Index Terms
- Structure and algorithms in the SINR wireless model
Index terms have been assigned to the content through auto-classification.
Recommendations
Iterative multiuser uplink and downlink beamforming under SINR constraints
We study the problem of power efficient multiuser beamforming transmission for both uplink and downlink. The base station is equipped with multiple antennas, whereas the mobile units have single antennas. In the uplink, interference is canceled by ...
MIMO CDMA antenna system for SINR enhancement
We present a system to enhance signal-to-interference plus noise ratio (SINR) for multiple-input-multiple-output (MIMO) direct-sequence code-division multiple-access (DS/CDMA) communications in the downlink for frequency-selective fading environments. ...
MaxźMin Weighted Downlink SINR With Uplink SINR Constraints for Full-Duplex MIMO Systems
In this paper, we investigate a max–min weighted signal-to-interference-plus-noise-ratio (SINR) problem in a full-duplex multiuser multiple-input-multiple-output system, where a full-duplex-capable base station (BS) equipped with multiple antennas ...
Comments