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

DOI10.1007/978-3-642-36092-3_14MaRDI QIDQ5507397zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Wireless scheduling with power control
• Wireless Scheduling with Power Control
• Wireless Link Scheduling With Power Control and SINR Constraints

Cited in

(7)

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

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)