Distributed link scheduling in wireless networks

DOI10.1142/S1793830920500585MaRDI QIDQ5858167zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, Philippe Nain

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

zbMATH Keywords

distributed algorithmwireless networkbinary interferencelink-scheduling algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Distributed wireless link scheduling in the SINR model
• Dynamic packet scheduling in wireless networks
• Wireless network algorithmics

Cites work

• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 6469247 (Why is no real title available?)
• A constructive proof of Vizing's theorem
• Data gathering in wireless networks
• Distributed Random Access Algorithm: Scheduling and Congestion Control
• Graph theory
• Induced matchings
• Lingering issues in distributed scheduling
• Log-weight scheduling in switched networks
• Markov Chains
• Markov chains and stochastic stability
• Matching theory
• Medium Access Using Queues
• NP-completeness of some generalizations of the maximum matching problem
• On the complexity of bandwidth allocation in radio networks
• Randomized scheduling algorithm for queueing networks
• Scheduling and performance limits of networks with constantly changing topology
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Stochastic geometry and wireless networks. Volume I. Theory
• Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
• The capacity of wireless networks
• Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

Cited in

(13)

• On the queue-overflow probabilities of a class of distributed scheduling algorithms
• scientific article; zbMATH DE number 2088585 (Why is no real title available?)
• Distributed priority scheduling and medium access in ad hoc networks
• Dynamic Distributed Scheduling in Random Access Networks
• Lingering issues in distributed scheduling
• Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks
• Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks
• Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
• Dynamic packet scheduling in wireless networks
• scientific article; zbMATH DE number 2090692 (Why is no real title available?)
• Distributed connectivity of wireless networks
• Stability and delay of distributed scheduling algorithms for networks of conflicting queues
• Models and algorithms for the reconfiguration of distributed wireless switching systems

This page was built for publication: Distributed link scheduling in wireless networks

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