Broadcast scheduling problem in SINR model

DOI10.1142/S0129054114500166MaRDI QIDQ2929620zbMATH OpenOpenAlexFDO

Authors Nhat Lam, Min Kyung An, Dung T. Huynh, Trac Nguyen

Publication date 14 November 2014

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054114500166

zbMATH Keywords

complexityschedulingbroadcastNP-hardnessSINRWSN

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Wireless scheduling with power control
• Wireless Scheduling with Power Control
• Algorithms for scheduling with power control in wireless networks
• On some bounds on the optimum schedule length in the SINR model

Cites work

• The capacity of wireless networks

This page was built for publication: Broadcast scheduling problem in SINR model

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