English
Related papers

Related papers: Poisson Receivers: a Probabilistic Framework for A…

200 papers

Sparse code multiple access (SCMA) scheme is considered to be one promising non-orthogonal multiple access technology for the future fifth generation (5G) communications. Due to the sparse nature, message passing algorithm (MPA) has been…

Information Theory · Computer Science 2017-12-06 Xiangming Meng , Yiqun Wu , Yan Chen , Meng Cheng

In random access protocols, the service rate depends on the number of stations with a packet buffered for transmission. We demonstrate via numerical analysis that this state-dependent rate along with the consideration of Poisson traffic and…

Networking and Internet Architecture · Computer Science 2014-05-23 Cristina Cano , David Malone

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of…

Information Theory · Computer Science 2019-02-28 Jinho Choi

This paper proposes a novel localization framework underpinned by a pinching-antenna (PA) system, in which the target location is estimated using received signal strength (RSS) measurements obtained from downlink signals transmitted by the…

Signal Processing · Electrical Eng. & Systems 2025-11-20 Jiajun He , Xidong Mu , Hien Quoc Ngo , Michail Matthaiou

A common assumption when modeling queuing systems is that arrivals behave like a Poisson process with constant parameter. In practice, however, call arrivals are often observed to be significantly overdispersed. This motivates that in this…

Probability · Mathematics 2017-03-07 Mariska Heemskerk , Julia Kuhn , Michel Mandjes

Slotted Aloha-based Random Access (RA) techniques have recently regained attention in light of the use of Interference Cancellation (IC) as a mean to exploit diversity created through the transmission of multiple burst copies per packet…

Information Theory · Computer Science 2015-01-29 Alessio Meloni , Maurizio Murroni

We obtain quenched hitting distributions to be compound Poissonian for a certain class of random dynamical systems. The theory is general and designed to accommodate non-uniformly expanding behavior and targets that do not overlap much with…

Dynamical Systems · Mathematics 2024-02-06 Lucas Amorim , Nicolai Haydn , Sandro Vaienti

In this paper we present a simple, stochastic-geometric model of a wireless access network exploiting the LoRA (Long Range) protocol, which is a non-expensive technology allowing for long-range, single-hop connectivity for the Internet of…

Networking and Internet Architecture · Computer Science 2019-06-19 Bartłomiej Błaszczyszyn , Paul Mühlethaler

An important receiver operation is to detect the presence specific preamble signals with unknown delays in the presence of scattering, Doppler effects and carrier offsets. This task, referred to as "link acquisition", is typically a…

Information Theory · Computer Science 2015-06-11 Xiao Li , Andrea Rueetschi , Anna Scaglione , Yonina C. Eldar

Grant-free access schemes are candidates to support future massive multiple access applications owing to their capability to reduce control signaling and latency. As a promising class of grant-free schemes, coded random access schemes can…

Information Theory · Computer Science 2022-08-25 Lorenzo Valentini , Marco Chiani , Enrico Paolini

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

Counting experiments often rely on Monte Carlo simulations for predictions of Poisson expectations. The accompanying uncertainty from the finite Monte Carlo sample size can be incorporated into parameter estimation by modifying the Poisson…

Instrumentation and Methods for Astrophysics · Physics 2020-04-22 Thorsten Glüsenkamp

Network-coded slotted ALOHA (NCSA) is a re- finement to the classic slotted ALOHA protocol which im- proves throughput by enabling multiple source transmissions per ALOHA slot using physical-layer network coding (PNC). The receiver detects…

Information Theory · Computer Science 2015-12-10 Terry Ferrett , Matthew C. Valenti

This work aims at combining adaptive protocol design, utility maximization and stochastic geometry. We focus on a spatial adaptation of Aloha within the framework of ad hoc networks. We consider quasi-static networks in which mobiles learn…

Networking and Internet Architecture · Computer Science 2013-03-07 François Baccelli , Chandramani Singh

Achieving long-term safety in uncertain/extreme environments while accounting for human preferences remains a fundamental challenge for autonomous systems. Existing methods often trade off long-term guarantees for fast real-time control and…

Systems and Control · Electrical Eng. & Systems 2026-05-11 Zhuoyuan Wang , Xiyu Deng , Hikaru Hoshino , Yorie Nakahira

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

Information Theory · Computer Science 2022-05-04 Dmitriy Kim , Georgi Georgiev , Natalya Markovskaya

We present a framework for the design of low-complexity and high-performance receivers for multidimensional overloaded NOMA systems. The framework is built upon a novel compressive sensing (CS) regularized maximum likelihood formulation of…

The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the…

Information Theory · Computer Science 2012-07-03 Nuno K. Pratas , Henning Thomsen , Cedomir Stefanovic , Petar Popovski

This paper considers the slotted ALOHA protocol in a communication channel shared by N users. It is assumed that the channel has the multiple-packet reception (MPR) capability that allows the correct reception of up to M ($1 \leq M < N$)…

Information Theory · Computer Science 2017-07-26 Yijin Zhang , Yuan-Hsun Lo , Feng Shu , Jun Li

Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower…

Information Theory · Computer Science 2018-04-03 Chuan Zhang , Chao Yang , Wei Xu , Shunqing Zhang , Zaichen Zhang , Xiaohu You