English
Related papers

Related papers: Asymptotic Performance of Coded Slotted ALOHA with…

200 papers

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu

Massive MTC support is an important future market segment, but not yet efficiently supported in cellular systems. In this paper we follow-up on recent concepts combining advanced MAC protocols with Compressed Sensing (CS) based multiuser…

Information Theory · Computer Science 2017-07-04 Gerhard Wunder , Cedomir Stefanovic , Petar Popovski , Lars Thiele

The efficiency of tag identification in an RFID system can be low down due to the tag collision problems. the tag collision problem occurs when a reader try to read multiple tags in an interrogation zone. as a result the reader does not…

Networking and Internet Architecture · Computer Science 2014-05-27 Tanveer Ahmad , Yan tian feng

We model a dense wireless local area network where the access points (APs) employ carrier sense multiple access (CSMA)-type medium access control protocol. In our model, the spatial locations of the set of active APs are modeled using the…

Information Theory · Computer Science 2022-09-05 Priyabrata Parida , Harpreet S. Dhillon

A $K$-user pseudo-orthogonal (PO) randomly spread CDMA system, equivalent to transmission over a subset of $K'\leq K$ single-user Gaussian channels, is introduced. The high signal-to-noise ratio performance of the PO-CDMA is analyzed by…

Information Theory · Computer Science 2007-07-13 Ori Shental , Ido Kanter

We analyze the asymptotic average and effective throughputs of a multiuser diversity scheme for a secondary multiuser network consisting of multiple secondary users (transmitters) and one secondary receiver. Considering a transmit power…

Information Theory · Computer Science 2018-06-29 Yazan H. Al-Badarneh , Costas N. Georghiades , Mohamed-Slim Alouini

Slotted Aloha has been widely adopted in various communication networks. Yet if the transmission probabilities and traffic input rates of transmitters are not properly regulated, their data queues may easily become unstable. For stability…

Networking and Internet Architecture · Computer Science 2024-06-05 Yunshan Yang , Lin Dai

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

This two-part paper series studies the performance of buffered Aloha networks with K-Exponential Backoff collision resolution algorithms. Part I focuses on stability and throughput analysis and Part II presents the delay analysis. In Part…

Networking and Internet Architecture · Computer Science 2009-07-27 Tony T. Lee , Lin Dai

We consider the unsourced random access problem with multiple receivers and propose a cell-free type solution for that. In our proposed scheme, the active users transmit their signals to the access points (APs) distributed in a geographical…

Emerging Technologies · Computer Science 2025-01-20 Mert Ozates , Mohammad Kazemi , Eduard Jorswieck , Deniz Gunduz

This work derives bounds on the jamming capacity of a slotted ALOHA system. A system with n legitimate users, each with a Bernoulli arrival process is considered. Packets are temporarily stored at the corresponding user queues, and a…

Information Theory · Computer Science 2008-08-06 Sandeep Bhadra , Shreeshankar Bodas , Sanjay Shakkottai , Sriram Vishwanath

We put forward a new algorithmic solution to the massive unsourced random access (URA) problem, by leveraging the rich spatial dimensionality offered by large-scale antenna arrays. This paper makes an observation that spatial signature is…

Information Theory · Computer Science 2020-09-16 Volodymyr Shyianov , Faouzi Bellili , Amine Mezghani , Ekram Hossain

We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The…

Data Structures and Algorithms · Computer Science 2018-07-30 Alexandr Andoni , Javad Ghaderi , Daniel Hsu , Dan Rubenstein , Omri Weinstein

We revisit the sample average approximation (SAA) approach for non-convex stochastic programming. We show that applying the SAA approach to problems with expected value equality constraints does not necessarily result in asymptotic…

Optimization and Control · Mathematics 2024-07-16 Thomas Lew , Riccardo Bonalli , Marco Pavone

The asymptotic behavior of stochastic gradient algorithms is studied. Relying on results from differential geometry (Lojasiewicz gradient inequality), the single limit-point convergence of the algorithm iterates is demonstrated and…

Optimization and Control · Mathematics 2013-09-19 Vladislav B. Tadic

In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive…

Information Theory · Computer Science 2024-07-24 Sheng Yang , Richard Combes

In this paper, we consider a distributed reception scenario where a transmitter broadcasts a signal to multiple geographically separated receive nodes over fading channels, and each node forwards a few bits representing a processed version…

Information Theory · Computer Science 2015-06-19 Junil Choi , David J. Love , Patrick Bidigare

In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access…

Information Theory · Computer Science 2015-05-05 Dong Min Kim , Seong-Lyun Kim

In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope of the signal-to-distortion (SDR) curve (unlike the…

Information Theory · Computer Science 2008-05-28 Mahmoud Taherzadeh , Amir K. Khandani

Machine-to-Machine (M2M) communication is now playing a market-changing role in a wide range of business world. However, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn…

Information Theory · Computer Science 2016-11-18 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang