Energy efficient multiuser scheduling: Exploiting the loss tolerance of the application

We address the problem of energy efficient scheduling for the loss tolerant applications by exploiting the multiuser diversity. The proposed scheduling scheme allows dropping of a certain predefined proportion of data packets on the transmitter side. However, there is a hard constraint on the maximum number of successively dropped packets. The scheduler exploits average data loss tolerance to reduce the average system energy expenditure while fulfills the hard constraint on successively dropped packets. We analyze the scheme using asymptotically large user limit. The numerical results illustrate the energy efficiency of the scheme as a function of the average packet drop probability and the maximum permitted successively dropped packets parameters.

• Publication year

  2012

• Venue

  Global Communications Conference

• Publication date

  2012-12-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/GLOCOM.2012.6503662
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Hard deadline constrained multiuser scheduling for random arrivals

  2011cited by this paper
• On the Near-Far Gain in Opportunistic and Cooperative Multiuser Communications

  2011cited by this paper
• Intelligent Packet Dropping for Optimal Energy-Delay Tradeoffs in Wireless Downlinks

  2009cited by this paper
• A class of mean field interaction models for computer and communication systems

  2008cited by this paper
• Packet Dropping Algorithms for Energy Savings

  2006cited by this paper
• Hard Fairness versus Proportional Fairness in Wireless Communications: the Single-Cell Case

  2006cited by this paper
• A distributed scheme for achieving energy-delay tradeoffs with multiple service classes over a dynamically varying network

  2004cited by this paper
• Communication over fading channels with delay constraints

  2002cited by this paper
• Packet scheduling with delay and loss differentiation

  2002cited by this paper
• Asymptotically optimal water-filling in vector multiple-access channels

  2001cited by this paper
• Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities

  1998cited by this paper
• Fast simulated annealing

  1987cited by this paper
• Optimization by Simulated Annealing

  1983cited by this paper

• Maximizing energy efficiency for loss tolerant applications: The packet buffering case

  2013cites this paper