Wireless scheduling with power control
From MaRDI portal
Publication:2933635
DOI10.1145/2390176.2390183zbMath1301.68074OpenAlexW1750839748MaRDI QIDQ2933635
Publication date: 5 December 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2390176.2390183
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (14)
Nearly optimal bounds for distributed wireless scheduling in the SINR model ⋮ Batched Point Location in SINR Diagrams via Algebraic Tools ⋮ Distributed wireless link scheduling in the SINR model ⋮ Network design under general wireless interference ⋮ A maximum clique based approximation algorithm for wireless link scheduling under SINR model ⋮ Leveraging multiple channels in ad hoc networks ⋮ Conflict graphs and the SINR-capacity of the mean power scheme ⋮ Computing large independent sets in a single round ⋮ Limitations of current wireless link scheduling algorithms ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ Exact formulations for the minimum interference problem ink-connectedad hocwireless networks ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ Unnamed Item ⋮ The Power of Oblivious Wireless Power
This page was built for publication: Wireless scheduling with power control
