English
Related papers

Related papers: Energy efficient coded random access for the wirel…

200 papers

An asynchronous $\ka$-active-user unsourced multiple access channel (AUMAC) is a key model for uncoordinated massive access in future networks. We focus on a scenario where each transmission is subject to the maximal delay constraint…

Information Theory · Computer Science 2025-01-28 Jyun-Sian Wu , Pin-Hsun Lin , Marcel A. Mross , Eduard A. Jorswieck

Multiple access communication systems enable numerous users to share common communication resources, playing a crucial role in wireless networks. With the emergence of the sixth generation (6G) and beyond communication networks, supporting…

Information Theory · Computer Science 2025-11-17 Mert Ozates , Mohammad Javad Ahmadi , Mohammad Kazemi , Deniz Gündüz , Tolga M. Duman

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…

Information Theory · Computer Science 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The…

Cryptography and Security · Computer Science 2009-10-28 Chunxuan Ye , Suhas Mathur , Alex Reznik , Yogendra Shah , Wade Trappe , Narayan Mandayam

We design a cross-layer approach to optimize the joint use of multi-packet reception and network coding, in order to relieve congestion. We construct a model for the behavior of the 802.11 MAC and apply it to several key canonical topology…

Networking and Internet Architecture · Computer Science 2011-02-01 Jason Cloud , Linda Zeger , Muriel Médard

This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of links in the network are independent. In…

Information Theory · Computer Science 2007-08-23 Zhenning Kong , Salah A. Aly , Emina Soljanin , Edmund M. Yeh , Andreas Klappenecker

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of…

Information Theory · Computer Science 2008-12-31 Tal Philosof , Ram Zamir , Uri Erez

A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a…

Information Theory · Computer Science 2016-08-24 Shashank Vatedka , Navin Kashyap

This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an…

Networking and Internet Architecture · Computer Science 2013-10-01 Manolis Ploumidis , Nikolaos Pappas , Vasilios A. Siris , Apostolos Traganitis

We investigate energy-efficiency issues and resource allocation policies for time division multi-access (TDMA) over fading channels in the power-limited regime. Supposing that the channels are frequency-flat block-fading and transmitters…

Information Theory · Computer Science 2007-07-13 Xin Wang , Georgios B. Giannakis

Space-ground communication systems are important in providing ubiquitous services in a large area. This paper considers the fairness designs under a load-balancing framework with heterogeneous receivers comprising access points (APs) and a…

Information Theory · Computer Science 2025-11-04 Trinh Van Chien , Ngo Tran Anh Thu , Nguyen Hoang Lam , Hien Quoc Ngo , Symeon Chatzinotas , Huynh Thi Thanh Binh

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

Information Theory · Computer Science 2017-12-19 Johan Östman , Giuseppe Durisi , Erik G. Ström , Mustafa C. Coşkun , Gianluigi Liva

We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to the simpler problem of code construction for source resolvability. Specifically, we propose a MAC resolvability code…

Information Theory · Computer Science 2022-03-03 Rumia Sultana , Remi A. Chou

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the…

Information Theory · Computer Science 2014-09-17 Sreejith Sreekumar , Bikash K. Dey , Sibi Raj B. Pillai

Channel coding from 2G to 5G has assumed the inputs bits at the physical layer to be uniformly distributed. However, hybrid automatic repeat request acknowledgement (HARQ-ACK) bits transmitted in the uplink are inherently non-uniformly…

Signal Processing · Electrical Eng. & Systems 2026-02-20 Akash Doshi , Pinar Sen , Kirill Ivanov , Wei Yang , June Namgoong , Runxin Wang , Rachel Wang , Taesang Yoo , Jing Jiang , Tingfang Ji

This paper studies the tradeoff between channel coding and ARQ (automatic repeat request) in Rayleigh block-fading channels. A heavily coded system corresponds to a low transmission rate with few ARQ re-transmissions, whereas lighter coding…

Information Theory · Computer Science 2015-03-13 Peng Wu , Nihar Jindal

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

Medium Access Control (MAC) address randomization is a key component for privacy protection in Wi-Fi networks. Current proposals periodically change the mobile device MAC addresses when it disconnects from the Access Point (AP). This way…

Networking and Internet Architecture · Computer Science 2024-05-27 Hongyu Jin , Panos Papadimitratos

Incremental redundancy with ACK/NACK feedback produces a variable-length stop-feedback (VLSF) code constrained to have $m$ decoding times, with an ACK/NACK feedback to the transmitter at each decoding time. This paper focuses on the…

Information Theory · Computer Science 2023-02-07 Hengjie Yang , Recep Can Yavas , Victoria Kostina , Richard D. Wesel