2013Unpublished venueOpen access

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

M. Majid Butt, Eduard A. Jorswieck, Björn Ottersten

Open full text 2 citations

Abstract

Energy efficient communication has emerged as one of the key areas of research due to its impact on industry and environment. Any potential degree of freedom (DoF) available in the system should be exploited smartly to design energy efficient systems. This paper proposes a framework for achieving energy efficiency for the data loss tolerant applications by exploiting the multiuser diversity and DoFs available through the packet loss pattern. For a real time application, there is a constraint on the maximum number of packets to be dropped successively that must be obeyed. We propose a channel-aware energy efficient scheduling scheme which schedules the packets such that the constraint on the average packet drop rate and the maximum number of successively dropped packets is fulfilled for the case when a finite number of unscheduled packets can be buffered. We analyze the scheme in the large user limit and show the energy gain due to buffering on the proposed scheme.

About this research paper

What this paper is about

Energy efficient communication has emerged as one of the key areas of research due to its impact on industry and environment. Any potential degree of freedom (DoF) available in the system should be exploited smartly to design energy efficient systems. This paper proposes a framework for achieving energy efficiency for the data loss tolerant applications by exploiting the multiuser diversity and DoFs available through the packet loss pattern. For a real time application, there is a constraint on the maximum number of packets to be dropped successively that must be obeyed. We propose a channel-aware energy efficient scheduling scheme which schedules the packets such that the constraint on the average packet drop rate and the maximum number of successively dropped packets is fulfilled for the case when a finite number of unscheduled packets can be buffered. We analyze the scheme in the large user limit and show the energy gain due to buffering on the proposed scheme.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Energy efficient communication has emerged as one of the key areas of research due to its impact on industry and environment. Any potential degree of freedom (DoF) available in the system should be exploited smartly to design energy efficient systems. This paper proposes a framework for achieving energy efficiency for the data loss tolerant applications by exploiting the multiuser diversity and DoFs available through the packet loss pattern. For a real time application, there is a constraint on the maximum number of packets to be dropped successively that must be obeyed. We propose a channel-aware energy efficient scheduling scheme which schedules the packets such that the constraint on the average packet drop rate and the maximum number of successively dropped packets is fulfilled for the case when a finite number of unscheduled packets can be buffered. We analyze the scheme in the large user limit and show the energy gain due to buffering on the proposed scheme.

Key concepts: Network packet, Computer science, Efficient energy use, Scheduling (production processes), Time constraint, Packet loss, Constraint (computer-aided design), Energy (signal processing)

Related papers

Back to paper searchBrowse research topicsOriginal source
Maximizing energy efficiency for loss tolerant applications: The packet buffering case — Research Paper | ScholarLens