Practical scheduling schemes with throughput guarantees for multi-hop wireless networks

DOI10.1016/J.COMNET.2009.10.001zbMATH Open1209.68063OpenAlexW1993878356MaRDI QIDQ975045FDOQ975045

Gagan Raj Gupta, Ness B. Shroff

Publication date: 8 June 2010

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2009.10.001

Recommendations

• Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks
• Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
• Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
• Effective Wireless Scheduling via Hypergraph Sketches
• A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks

zbMATH Keywords

stabilitypartitionschedulingmixed integer programmingwireless networks\(K\)-hop interferencethroughput guarantee

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (14)

• Online self-organizing network control with time averaged weighted throughput objective
• No-wait scheduling in single-hop multi-channel lans
• Effective Wireless Scheduling via Hypergraph Sketches
• Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints
• Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
• Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
• A Large Deviations Analysis of Scheduling in Wireless Networks
• A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks
• Title not available (Why is that?)
• Optimal multi-TDMA scheduling in ring topology networks
• Routing and scheduling in multihop wireless networks with time-varying channels
• Dependability enhancement of mission-critical wireless networks by message scheduling
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints

This page was built for publication: Practical scheduling schemes with throughput guarantees for multi-hop wireless networks

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