English
Related papers

Related papers: Throughput Analysis of Buffer-Constrained Wireless…

200 papers

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…

Information Theory · Computer Science 2021-09-29 Alejandro Lancho , Johan Östman , Giuseppe Durisi

In this paper, wireless video transmission over full-duplex channels under total bandwidth and minimum required quality constraints is studied. In order to provide the desired performance levels to the end-users in real-time video…

Information Theory · Computer Science 2017-07-27 Chuang Ye , M. Cenk Gursoy , Senem Velipasalar

We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to…

Networking and Internet Architecture · Computer Science 2013-02-26 Javad Ghaderi , Sem Borst , Phil Whiting

Quantum communication networks require transmission of high-fidelity, uncoded qubits for applications such as entanglement distribution and quantum key distribution. However, current implementations are constrained by limited buffer…

Quantum Physics · Physics 2026-03-27 Padma Priyanka , Avhishek Chatterjee , Sheetal Kalyani

We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, where each packet requires several rounds of processing before it can be transmitted from the queue buffer. The…

Networking and Internet Architecture · Computer Science 2013-09-06 Kirill Kogan , Alejandro Lopez-Ortiz , Sergey I. Nikolenko , Gabriel Scalosub , Michael Segal

In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model wireless…

Networking and Internet Architecture · Computer Science 2010-06-08 Vicent Cholvi , Dariusz R. Kowalski

Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end…

Networking and Internet Architecture · Computer Science 2017-09-13 Rahul Singh , P. R. Kumar , Eytan Modiano

Hybrid Automatic Repeat Request (HARQ) is a high performance communication protocol, leading to effective use of the wireless channel and the resources with only limited feedback about the channel state information (CSI) to the transmitter.…

Information Theory · Computer Science 2013-12-04 Yi Li , M. Cenk Gursoy , Senem Velipasalar

Max weighted queue (MWQ) control policy is a widely used cross-layer control policy that achieves queue stability and a reasonable delay performance. In most of the existing literature, it is assumed that optimal MWQ policy can be obtained…

Systems and Control · Computer Science 2013-11-20 Junting Chen , Vincent K. N. Lau

This work proposes adaptive buffer-aided distributed space-time coding schemes and algorithms with feedback for wireless networks equipped with buffer-aided relays. The proposed schemes employ a maximum likelihood receiver at the…

Information Theory · Computer Science 2016-09-20 R. C. de Lamare , T. Peng

Cross-layer analysis has been gaining an increasing attention as a powerful tool to study and assess different quality-of-service (QoS) mechanisms in wireless networks. Regarding the physical and data-link layers, in this paper we provide a…

Information Theory · Computer Science 2018-05-01 Marwan Hammouda , Jürgen Peissig

In this paper, a downlink scenario in which a single-antenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. It is assumed that channel state information is perfectly known at…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Alireza Bayesteh , Amir K. Khandani

This work investigates the fundamental limits of communication over a noisy discrete memoryless channel that wears out, in the sense of signal-dependent catastrophic failure. In particular, we consider a channel that starts as a memoryless…

Information Theory · Computer Science 2018-08-07 Ting-Yi Wu , Lav R. Varshney , Vincent Y. F. Tan

This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters.…

Information Theory · Computer Science 2021-03-26 Parimal Parag , Jean-Francois Chamberland , Henry D. Pfister , Krishna R. Narayanan

This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise…

Networking and Internet Architecture · Computer Science 2008-12-31 Ashutosh Deepak Gore

Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become…

Information Theory · Computer Science 2016-11-17 Rui A. Costa , Daniele Munaretto , Joerg Widmer , Joao Barros

For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…

Information Theory · Computer Science 2013-10-04 Harpreet S. Dhillon , Howard C. Huang , Harish Viswanathan , Reinaldo A. Valenzuela

The rapid growth of data volume and the accompanying congestion problems over the wireless networks have been critical issues to content providers. A novel technique, termed as coded cache, is proposed to relieve the burden. Through…

Networking and Internet Architecture · Computer Science 2015-04-08 Wei Huang , Sinong Wang , Lianghui Ding , Feng Yang , Wenjun Zhang

Wireless sensor networks have been increasingly used for real-time surveillance over large areas. In such applications, it is important to support end-to-end delay constraints for packet deliveries even when the corresponding flows require…

Networking and Internet Architecture · Computer Science 2012-04-23 I-Hong Hou