The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication

DOI10.1145/3477144MaRDI QIDQ6051926zbMATH OpenOpenAlexFDO

Authors E. Kantor, Zvi Lotker, M. Parter, David Peleg

Publication date 23 October 2023

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3477144

zbMATH Keywords

communicationpower controlSINR

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• \textsc{Maximal Independent Sets} in radio networks
• A constant-factor approximation for wireless capacity maximization with power control in the SINR model
• A joint solution to scheduling and power control for multicasting in wireless ad hoc networks
• Algorithms in real algebraic geometry
• Computing handbook. In 2 volumes
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 51485 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• SINR diagrams, convexity and its applications in wireless networks
• The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
• The topology of wireless communication
• The topology of wireless communication
• The topology of wireless communication on a line
• Wireless capacity with oblivious power in general metrics
• Wireless Link Scheduling With Power Control and SINR Constraints

This page was built for publication: The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051926)