Power Control for Packet Streaming with Head-of-Line Deadlines
Neal Master, Nicholas Bambos

TL;DR
This paper develops a dynamic programming model for power control in wireless streaming with packet deadlines, providing analytic insights and a low-complexity scheme that outperforms benchmarks in simulations.
Contribution
It offers a novel analytic characterization of power control strategies with deadlines and backlog considerations, and introduces a practical approximation scheme.
Findings
Analytic characterization of power control with fixed interference
Monotonicity of power levels with backlog and deadlines
Proposed low-complexity power control scheme outperforms benchmarks
Abstract
We consider a mathematical model for streaming media packets (as the motivating key example) from a transmitter buffer to a receiver over a wireless link while controlling the transmitter power (hence, the packet/job processing rate). When each packet comes to the head-of-line (HOL) in the buffer, it is given a deadline which is the maximum number of times the transmitter can attempt retransmission in order to successfully transmit the packet. If this number of transmission attempts is exhausted, the packet is ejected from the buffer and the next packet comes to the HOL. Costs are incurred in each time slot for holding packets in the buffer, expending transmitter power, and ejecting packets which exceed their deadlines. We investigate how transmission power should be chosen so as to minimize the total cost of transmitting the items in the buffer. We formulate the optimal power…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Network Optimization · Cooperative Communication and Network Coding · Advanced MIMO Systems Optimization
