An Investigation on the Nature of Wireless Scheduling

No abstract is available for this paper.

• Publication year

  2010

• Venue

  2010 Proceedings IEEE INFOCOM

• Publication date

  2010-03-14

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/INFCOM.2010.5462087
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Refined Performance Characterization of Longest-Queue-First Policy in Wireless Networks

  2011cited by this paper
• A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

  2010cited by this paper
• Maximizing Utility via Random Access without Message Passing

  2008cited by this paper
• Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks

  2008cited by this paper
• A distributed CSMA algorithm for throughput and utility maximization in wireless networks

  2008cited by this paper
• Delay Analysis for Maximal Scheduling in Wireless Networks with Bursty Traffic

  2008cited by this paper
• Local pooling conditions for joint routing and scheduling

  2008cited by this paper
• Distributed algorithm and reversible network

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

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

  2008cited by this paper
• Complexity in wireless scheduling: impact and tradeoffs

  2008influential reference
• Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks

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

  2006cited by this paper
• Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach

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

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

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

  2006cited by this paper
• Wireless Link Scheduling With Power Control and SINR Constraints

  2006cited by this paper
• Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

  2006cited by this paper
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits

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

  2006cited by this paper
• Stability and capacity of regular wireless networks

  2005cited by this paper
• The impact of imperfect scheduling on cross-layer rate control in wireless networks

  2005cited by this paper
• Tradeoffs in Delay Guarantees and Computation Complexity for Packet Switches NN

  2002cited by this paper
• Delay bounds for approximate maximum weight matching algorithms for input queued switches

  2002cited by this paper
• On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

  2002cited by this paper
• Approximate strong separation with application in fractional graph coloring and preemptive scheduling

  2002cited by this paper
• RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN

  2001cited by this paper
• On wireless spectrum estimation and generalized graph coloring

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

  1998cited by this paper
• Zero knowledge and the chromatic number

  1996cited by this paper
• On the hardness of approximating minimization problems

  1993cited by this paper
• A simple local-control approximation algorithm for multicommodity flow

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

  1990cited by this paper
• Link scheduling in polynomial time

  1988influential reference
• Geometric Algorithms and Combinatorial Optimization

  1988cited by this paper
• The ellipsoid method and its consequences in combinatorial optimization

  1981cited by this paper

• Scheduling Wireless Links in the Physical Interference Model by Fractional Edge Coloring

  2018cites this paper
• Optimal Link Scheduling for Age Minimization in Wireless Systems

  2018cites this paper
• I-CSMA: A Link-Scheduling Algorithm for Wireless Networks Based on Ising Model

  2018cites this paper
• Shortest Link Scheduling Algorithms in Wireless Networks Under the SINR Model

  2017cites this paper
• Improving the queue size and delay performance with the I-CSMA link scheduling algorithm

  2017cites this paper
• A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

  2016cites this paper
• Scheduling wireless links by vertex multicoloring in the physical interference model

  2015cites this paper
• Optimal delay bound for maximum weight scheduling policy in wireless networks

  2014cites this paper
• Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks

  2014cites this paper
• Minimum-Time Link Scheduling for Emptying Wireless Systems: Solution Characterization and Algorithmic Framework

  2014cites this paper
• A distributed CSMA algorithm for wireless networks based on Ising model

  2013cites this paper
• Delay analysis of the approximate maximum weight scheduling in wireless networks

  2013cites this paper
• Design of Efficient Resource Allocation Algorithms for Wireless Networks: High Throughput, Small Delay, and Low Complexity

  2012cites this paper
• Minimum-Length Scheduling with Finite Queues: Solution Characterization and Algorithmic Framework

  2012cites this paper
• Interference Constrained Relay Selection of D2D Communication for Relay Purpose Underlaying Cellular Networks

  2012cites this paper
• On emptying a wireless network in minimum time

  2012cites this paper
• Optimal D2D user allocation over multi-bands under heterogeneous networks

  2012cites this paper
• Minimum-length scheduling in wireless networks with multi-user detection and interference cancellation: Optimization and performance evaluation

  2012cites this paper
• Performance of greedy scheduling algorithm in wireless networks

  2012cites this paper
• Mobility support and bandwidth aggregation in heterogeneous wireless networks

  2012cites this paper
• Performance Guarantee Under Longest-Queue-First Schedule in Wireless Networks

  2011influential citation