Pith. sign in

REVIEW

Energy Efficient Multiuser Scheduling: Statistical Guarantees on Bursty Packet Loss

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1405.6154 v1 pith:YQFKZFXU submitted 2014-05-23 cs.IT cs.NImath.IT

classification cs.ITcs.NImath.IT
keywords energypacketbufferlosssizestatisticalsystemachieve
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we consider energy efficient multiuser scheduling. Packet loss tolerance of the applications is exploited to minimize average system energy. There is a constraint on average packet drop rate and maximum number of packets dropped successively (bursty loss). A finite buffer size is assumed. We propose a scheme which schedules the users opportunistically according to the channel conditions, packet loss constraints and buffer size parameters. We assume imperfect channel state information at the transmitter side and analyze the scheme in large user limit using stochastic optimization techniques. First, we optimize system energy for a fixed buffer size which results in a corresponding statistical guarantee on successive packet drop. Then, we determine the minimum buffer size to achieve a target (improved) energy efficiency for the same (or better) statistical guarantee. We show that buffer size can be traded effectively to achieve system energy efficiency for target statistical guarantees on packet loss parameters.

Discussion (0). Continue with ORCID to comment.

Pith tools