Distributed link scheduling in wireless networks
From MaRDI portal
Publication:5858167
DOI10.1142/S1793830920500585zbMath1502.68362OpenAlexW3108709140MaRDI QIDQ5858167
Philippe Nain, Dorian Mazauric, Vishal Misra, Jean-Claude Bermond
Publication date: 9 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830920500585
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) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Log-weight scheduling in switched networks
- Lingering issues in distributed scheduling
- Markov chains and stochastic stability
- On the complexity of bandwidth allocation in radio networks
- Matching theory
- NP-completeness of some generalizations of the maximum matching problem
- A constructive proof of Vizing's theorem
- Induced matchings
- Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
- Randomized scheduling algorithm for queueing networks
- Graph Theory
- Data Gathering in Wireless Networks
- Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
- Markov Chains
- Scheduling and performance limits of networks with constantly changing topology
- The capacity of wireless networks
- Stochastic Geometry and Wireless Networks: Volume I Theory
- Distributed Random Access Algorithm: Scheduling and Congestion Control
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Medium Access Using Queues
This page was built for publication: Distributed link scheduling in wireless networks
