English
Related papers

Related papers: Energy-Efficient Packet Scheduling with Finite Blo…

200 papers

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

Wirelessly powered communications will entail short packets due to naturally small payloads, low-latency requirements and/or insufficient energy resources to support longer transmissions. In this paper, a wirelessly powered communication…

Information Theory · Computer Science 2016-11-03 Talha Ahmed Khan , Robert W. Heath , Petar Popovski

We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast…

Information Theory · Computer Science 2016-11-18 Ahmed Badr , Devin Lui , Ashish Khisti

In this paper we design throughput-optimal dynamic broad- cast algorithms for multi-hop networks with arbitrary topolo- gies. Most of the previous broadcast algorithms route pack- ets along spanning trees, rooted at the source node. For…

Data Structures and Algorithms · Computer Science 2016-04-05 Abhishek Sinha , Georgios Paschos , Eytan Modiano

Edge caching and computing have been regarded as an efficient approach to tackle the wireless spectrum crunch problem. In this paper, we design a general coded caching with device computing strategy for content computation, e.g., virtual…

Information Theory · Computer Science 2020-02-17 Yingjiao Li , Zhiyong Chen , Meixia Tao

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…

Networking and Internet Architecture · Computer Science 2016-10-19 Neal Master , Nicholas Bambos

In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such constraints is captured by the effective capacity formulation.…

Information Theory · Computer Science 2010-09-16 Mustafa Cenk Gursoy

Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce the reallocation problem that models the scheduling in…

Data Structures and Algorithms · Computer Science 2021-11-05 Toshimasa Ishii , Jun Kawahara , Kazuhisa Makino , Hirotaka Ono

Approaching capacity with low complexity is a very challenging task. In this paper, we review and compare three promising coding solutions to achieve that, which are suitable for future very high-throughput, low-complexity optical…

Information Theory · Computer Science 2019-09-20 Alexandre Graell i Amat , Gianluigi Liva , Fabian Steiner

Wireless networks with energy harvesting battery powered nodes are quickly emerging as a viable option for future wireless networks with extended lifetime. Equally important to their counterpart in the design of energy harvesting radios are…

Information Theory · Computer Science 2015-03-17 Kaya Tutuncuoglu , Aylin Yener

To increase mobile batteries' lifetime and improve quality of experience for computation-intensive and latency-sensitive applications, mobile edge computing has received significant interest. Designing energy-efficient mobile edge computing…

Information Theory · Computer Science 2016-11-08 Junfeng Guo , Zhaozhe Song , Ying Cui

We study the problem of online power control for energy harvesting communication nodes with random energy arrivals and a finite battery. We assume a block i.i.d. stochastic model for the energy arrivals, in which the energy arrivals are…

Information Theory · Computer Science 2017-06-27 Dor Shaviv , Ayfer Özgür

This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…

Networking and Internet Architecture · Computer Science 2010-07-12 Juan Jose Jaramillo , R. Srikant , Lei Ying

Coded multicasting has been shown to improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes that have been shown to achieve order-optimal perfor- mance…

Information Theory · Computer Science 2015-11-25 Mingyue Ji , Karthikeyan Shanmugam , Giuseppe Vettigli , Jaime Llorca , Antonia M. Tulino , Giuseppe Caire

The problem of scheduling in quantum networks amounts to choosing which entanglement swapping operations to perform to better serve user demand. The choice can be carried out following a variety of criteria (e.g. ensuring all users are…

Quantum Physics · Physics 2025-10-08 Paolo Fittipaldi

We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within $\epsilon > 0$ of the Shannon capacity with a block length, construction complexity, and decoding complexity all…

Information Theory · Computer Science 2013-11-19 Venkatesan Guruswami , Patrick Xia

Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be error-free. During non-peak hours, all the users have full…

Information Theory · Computer Science 2017-12-22 Nujoom Sageer Karat , Anoop Thomas , B. Sundar Rajan

Assuming noisy feedback channels, this paper investigates the data transmission efficiency and robustness of different automatic repeat request (ARQ) schemes using adaptive power allocation. Considering different block-fading channel…

Information Theory · Computer Science 2013-10-16 Behrooz Makki , Alexandre Graell i Amat , Thomas Eriksson

This paper characterizes the trade-offs between information and energy transmission over an additive white Gaussian noise channel in the finite block-length regime with finite channel input symbols. These trade-offs are characterized in the…

Information Theory · Computer Science 2024-08-16 Sadaf ul Zuhra , Samir M. Perlaza , H. Vincent Poor , Mikael Skoglund

This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary…

Information Theory · Computer Science 2019-02-04 Rahul Devassy , Giuseppe Durisi , Guido Carlo Ferrante , Osvaldo Simeone , Elif Uysal