On some bounds on the optimum schedule length in the SINR model

DOI10.1007/978-3-642-36092-3_14zbMATH Open1351.68045OpenAlexW1036729261MaRDI QIDQ5507397FDOQ5507397

Authors: Tigran Tonoyan 

Publication date: 19 December 2016

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36092-3_14

Recommendations

• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Wireless scheduling with power control
• Wireless Scheduling with Power Control
• Wireless Link Scheduling With Power Control and SINR Constraints

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (6)

• Vertex coloring edge-weighted digraphs
• The Power of Oblivious Wireless Power
• Effective Wireless Scheduling via Hypergraph Sketches
• Conflict graphs and the SINR-capacity of the mean power scheme
• Limitations of current wireless link scheduling algorithms
• Wireless Link Scheduling With Power Control and SINR Constraints

This page was built for publication: On some bounds on the optimum schedule length in the SINR model

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