English
Related papers

Related papers: Bounding Queue Length Violation Probability of Joi…

200 papers

In this work we analyze the distribution of quantum entanglement over communication channels in the millimeter-wave regime. The motivation for such a study is the possibility for next-generation wireless networks (beyond 5G) to accommodate…

Quantum Physics · Physics 2018-01-03 Nedasadat Hosseinidehaj , Robert Malaney

This paper considers the massive random access problem in MIMO quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum energy-per-bit required for each active user to transmit $J$ bits…

Information Theory · Computer Science 2022-10-24 Junyuan Gao , Yongpeng Wu , Shuo Shao , Wei Yang , H. Vincent Poor

In this paper, throughput and energy efficiency of secure wireless transmission of delay sensitive data generated by random sources is studied. A fading broadcast model in which the transmitter sends confidential and common messages to two…

Information Theory · Computer Science 2017-04-10 Mustafa Ozmen , M. Cenk Gursoy

Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency…

Information Theory · Computer Science 2024-11-05 Lintao Li , Wei Chen , Petar Popovski , Khaled B. Letaief

In this article, we investigate the transient behavior of a sequence of packets/bits traversing a multi-hop wireless network. Our work is motivated by novel applications from the domain of process automation, Machine-Type Communication…

Networking and Internet Architecture · Computer Science 2018-06-12 Jaya Prakash Champati , Hussein Al-Zubaidy , James Gross

The time-varying feature of wireless channels usually makes the hard delay bound for data transmissions unrealistic to guarantee. In contrast, the statistically-bounded delay with a small violation probability has been widely used for delay…

Information Theory · Computer Science 2011-05-03 Qinghe Du , Yi Huang , Pinyi Ren , Chao Zhang

We say that a random variable is $light$-$tailed$ if moments of order $2+\epsilon$ are finite for some $\epsilon>0$; otherwise, we say that it is $heavy$-$tailed$. We study queueing networks that operate under the Max-Weight scheduling…

Systems and Control · Electrical Eng. & Systems 2023-02-28 Arsalan Sharifnassab , John N. Tsitsiklis

In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the…

Information Theory · Computer Science 2010-12-02 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Ensuring the ultra-low end-to-end latency and ultrahigh reliability required by tactile internet is challenging. This is especially true when the stringent Quality-of-Service (QoS) requirement is expected to be satisfied not at the cost of…

Information Theory · Computer Science 2016-10-11 Changyang She , Chenyang Yang

Energy efficiency and quality of service (QoS) guarantees are the key design goals for the 5G wireless communication systems. In this context, we discuss a multiuser scheduling scheme over fading channels for loss tolerant applications. The…

Information Theory · Computer Science 2016-11-10 M. Majid Butt , Eduard A. Jorswieck , Amr Mohamed

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

Caching at the edge of wireless networks is a keytechnology to reduce traffic in the backhaul link. However, aconcentrated amount of requests during peak-periods may causethe outage of the system, meaning that the network is not ableto…

Networking and Internet Architecture · Computer Science 2021-01-05 Estefanía Recayte , Andrea Munari

In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…

Information Theory · Computer Science 2010-10-11 RadhaKrishna Ganti , Martin Haenggi

Quantum information science may lead to technological breakthroughs in computing, cryptography and sensing. For the implementation of these tasks, however, complex devices with many components are needed and the quantum advantage may easily…

Quantum Physics · Physics 2024-05-08 Lisa T. Weinbrenner , Lina Vandré , Tim Coopmans , Otfried Gühne

Mediumband wireless communication refers to wireless communication through a class of channels known as mediumband that exists on the TmTs-plane. This paper, through statistical analysis and computer simulations, studies the performance…

Information Theory · Computer Science 2023-11-23 Dushyantha A Basnayaka , Jiabin Jia

Contrary to the vast majority of works on simultaneous wireless information and power transfer that provide information-theoretic limits for the separate receiver architecture, in this work we focus on the integrated receiver and provide a…

Information Theory · Computer Science 2026-04-22 Konstantinos Ntontin , Symeon Chatzinotas

In the study of large scale stochastic networks with resource management, differential equations and mean-field limits are two key techniques. Recent research shows that the expected fraction vector (that is, the tailed probability vector)…

Probability · Mathematics 2013-05-27 Quan-Lin Li

Future autonomous systems require wireless connectivity able to support extremely stringent requirements on both latency and reliability. In this paper, we leverage recent developments in the field of finite-blocklength information theory…

Information Theory · Computer Science 2016-11-29 Johan Östman , Giuseppe Durisi , Erik G. Ström , Jingya Li , Henrik Sahlin , Gianluigi Liva

We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for…

Information Theory · Computer Science 2019-07-23 Suhas S Kowshik , Kirill Andreev , Alexey Frolov , Yury Polyanskiy

In the realm of wireless communication, stochastic modeling of channels is instrumental for the assessment and design of operational systems. Deep learning neural networks (DLNN), including generative adversarial networks (GANs), are being…

Information Theory · Computer Science 2024-10-28 Lee Youngmin , Ma Xiaomin , Lang S. I. D. Andrew , Valderrama-Araya F. Enrique , Chapuis L. Andrew