ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

Sukumaran, Vineeth Bala and Mukherji, Utpal (2015) Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 61 (11). pp. 6145-6167.

[img] PDF
IEE_Tra_Inf_The_61-11_6145_2015.pdf - Published Version
Restricted to Registered users only

Download (981kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/TIT.2015.2477303

Abstract

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Item Type: Journal Article
Publication: IEEE TRANSACTIONS ON INFORMATION THEORY
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Additional Information: Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
Keywords: Power-delay tradeoff; IID fading; asymptotic bounds; control of queues; stationary queue length distribution; geometric bounds
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 19 Nov 2015 04:49
Last Modified: 19 Nov 2015 04:49
URI: http://eprints.iisc.ac.in/id/eprint/52756

Actions (login required)

View Item View Item