Low complexity stable link scheduling for maximizing throughput in wireless networks

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

• Publication date

  2009-06-22

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/SAHCN.2009.5168943
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

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

  2010cited by this paper
• A local greedy scheduling scheme with provable performance guarantee

  2008cited by this paper
• Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks

  2008cited by this paper
• Adaptive network coding and scheduling for maximizing throughput in wireless networks

  2007cited by this paper
• Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks

  2007cited by this paper
• Distributed Scheduling Schemes for Throughput Guarantees in Wireless Networks

  2007cited by this paper
• Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks

  2006cited by this paper
• Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks

  2006cited by this paper
• The impact of imperfect scheduling on cross-Layer congestion control in wireless networks

  2006cited by this paper
• Distributed Link Scheduling With Constant Overhead

  2006cited by this paper
• Maximizing throughput in wireless networks via gossiping

  2006cited by this paper
• Efficient interference-aware TDMA link scheduling for static wireless networks

  2006cited by this paper
• On the Complexity of Scheduling in Wireless Networks

  2006cited by this paper
• Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks

  2006cited by this paper
• Local approximation schemes for ad hoc and sensor networks

  2005cited by this paper
• Conversion of coloring algorithms into maximum weight independent set algorithms

  2005cited by this paper
• Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

  2005cited by this paper
• Low-complexity distributed fair scheduling for wireless multi-hop networks

  2005cited by this paper
• A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

  2004cited by this paper
• Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay

  2003cited by this paper
• Impact of Interference on Multi-Hop Wireless Network Performance

  2003cited by this paper
• Opportunistic fair scheduling over multiple wireless channels

  2003cited by this paper
• On the capacity improvement of ad hoc wireless networks using directional antennas

  2003cited by this paper
• Geometric spanners for wireless ad hoc networks

  2002cited by this paper
• Maxmin fair scheduling in wireless networks

  2002cited by this paper
• Polynomial-time approximation schemes for geometric graphs

  2001cited by this paper
• Distributed fair scheduling in a wireless LAN

  2000cited by this paper
• Fair scheduling in wireless packet networks

  1999cited by this paper
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

  1998cited by this paper
• Linear complexity algorithms for maximum throughput in radio networks and input queued switches

  1998cited by this paper
• Simple heuristics for unit disk graphs

  1994cited by this paper
• Stability of queueing networks and scheduling policies

  1993cited by this paper
• Scheduling algorithms for multihop radio networks

  1993cited by this paper
• Scheduling algorithms for multi-hop radio networks

  1992cited by this paper
• Distributed scheduling based on due dates and buffer priorities

  1991cited by this paper
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

  1990influential reference
• On a Real-Time Scheduling Problem

  1978cited by this paper

• Scheduling with predictable link reliability for wireless networked control

  2015cites this paper
• Predictable Real-Time Wireless Networking For Sensing And Control

  2015cites this paper
• Stable wireless link scheduling subject to physical interference with power control

  2014cites this paper
• MT-NCOR: A practical optimization method for network coded opportunistic routing in WMN

  2014cites this paper
• Almost Optimal Channel Access in Multi-Hop Networks with Unknown Channel Variables

  2013cites this paper
• Throughput Optimizing Localized Link Scheduling for Multihop Wireless Networks under Physical Interference Model

  2013cites this paper
• Cooperative Game Theory and Its Application in Localization Algorithms

  2013cites this paper
• Poster abstract: PRK-based scheduling for predictable link reliability in wireless networked sensing and control

  2013cites this paper
• A DYNAMIC STABLE LINK PLACEMENT APPROACH TO IMPROVE NETWORK THROUGHPUT

  2012influential citation
• Link scheduling for throughput maximization in multihop wireless networks under physical interference

  2012cites this paper
• Distributed link scheduling for throughput maximization under physical interference model

  2012cites this paper
• WiMAX/OFDMA Burst Scheduling Algorithm to Maximize Scheduled Data

  2012cites this paper
• Network Optimization for Lightweight Stochastic Scheduling in Underwater Sensor Networks

  2012cites this paper
• The Sentinel Problem for a Multi-hop Sensor Network

  2010cites this paper