Improved algorithms for latency minimization in wireless networks

DOI10.1016/j.tcs.2010.05.004zbMath1218.68059OpenAlexW2154125468MaRDI QIDQ541672

Alexander Fanghänel, Berthold Vöcking, Thomas Kesselheim

Publication date: 7 June 2011

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

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

zbMATH Keywords

schedulingwireless networkinterferenceroutingphysical modelmulti-hopSINRsingle-hop

Mathematics Subject Classification ID

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

Related Items (5)

Distributed wireless link scheduling in the SINR model ⋮ Online capacity maximization in wireless networks ⋮ A simple augmentation method for matchings with applications to streaming algorithms ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ Vertex coloring edge-weighted digraphs

Cites Work

• Unnamed Item
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Distributed Contention Resolution in Wireless Networks
• Wireless Communication Is in APX
• Randomized Routing and Sorting on Fixed-Connection Networks
• The capacity of wireless networks
• A packet routing protocol for arbitrary networks
• Balls and bins: A study in negative dependence
• Oblivious interference scheduling
• Models and approximation algorithms for channel assignment in radio networks

This page was built for publication: Improved algorithms for latency minimization in wireless networks