scientific article; zbMATH DE number 6783491
From MaRDI portal
Publication:5365138
zbMath1373.68050arXiv1007.1611MaRDI QIDQ5365138
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1007.1611
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (21)
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 ⋮ Constant-approximation for optimal data aggregation with physical interference ⋮ An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models ⋮ Network design under general wireless interference ⋮ Online capacity maximization in wireless networks ⋮ The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication ⋮ Conflict graphs and the SINR-capacity of the mean power scheme ⋮ The topology of wireless communication on a line ⋮ Limitations of current wireless link scheduling algorithms ⋮ Deterministic protocols in the SINR model without knowledge of coordinates ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ Convergence Time of Power-Control Dynamics ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Optimizing compatible sets in wireless networks through integer programming ⋮ Wireless capacity with arbitrary gain matrix ⋮ Comparative study of approximation algorithms and heuristics for SINR scheduling with power control ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ Unnamed Item ⋮ The Power of Oblivious Wireless Power
This page was built for publication: