Limitations of current wireless link scheduling algorithms

DOI10.1016/J.TCS.2020.07.033MaRDI QIDQ2202005zbMATH OpenOpenAlexFDO

Authors Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan

Publication date 17 September 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.07.033

zbMATH Keywords

link schedulinglower boundwireless network

Mathematics Subject Classification ID

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

Recommendations

• Wireless scheduling with power control
• Wireless Scheduling with Power Control
• Distributed wireless link scheduling in the SINR model
• Effective Wireless Scheduling via Hypergraph Sketches

Cites work

• A constant-factor approximation for wireless capacity maximization with power control in the SINR model
• A tight bound for online colouring of disk graphs
• Approximation algorithms for wireless link scheduling with flexible data rates
• Beyond geometry: towards fully realistic wireless models
• Broadcast in the Ad Hoc SINR Model
• Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
• Constructive proofs of concentration bounds
• Distributed algorithms for coloring interval graphs
• Distributed contention resolution in wireless networks
• How well can graphs represent wireless interference?
• Oblivious interference scheduling
• On some bounds on the optimum schedule length in the SINR model
• On the impact of geometry on ad hoc communication in wireless networks
• On-line and first fit colorings of graphs
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• SINR diagrams, convexity and its applications in wireless networks
• The capacity of wireless networks
• The power of non-uniform wireless power
• The price of local power control in wireless scheduling
• Vertex coloring edge-weighted digraphs
• Wireless capacity with oblivious power in general metrics
• Wireless Communication Is in APX
• Wireless connectivity and capacity
• Wireless scheduling with power control

Cited in

(8)

• Hypergraph modeling and approximation algorithms for the minimum length link scheduling in multiuser MIMO networks
• Approximation algorithms for wireless link scheduling with flexible data rates
• How well can graphs represent wireless interference?
• Efficiency of wireless networks: approximation algorithms for the physical interference model
• Wireless Communication Is in APX
• Universal framework for wireless scheduling problems
• Effective Wireless Scheduling via Hypergraph Sketches
• Approximate dynamic programming for link scheduling in wireless mesh networks

This page was built for publication: Limitations of current wireless link scheduling algorithms

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