English
Related papers

Related papers: Recurrence region of multiuser Aloha

200 papers

We derive the complete set of partial wave unitarity bounds on the most general Axion-Like Particle (ALP) effective interactions up to dimension 8 in the limit of large center-of-mass energy. Exploiting a recently developed formalism based…

High Energy Physics - Phenomenology · Physics 2025-10-17 Luigi C. Bresciani , Gabriele Levati , Paride Paradisi

Necessary and sufficient conditions are established for the stability of a high-mobility N-class Aloha network, where the position of the sources follows a Poisson point process, each source has an infinity capacity buffer, packets arrive…

Information Theory · Computer Science 2024-10-30 P. S. Dester , P. Cardieri , J. M. C. Brito

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with…

Information Theory · Computer Science 2016-11-18 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

This paper provides new inner and outer bounds on the capacity region of optical intensity multiple access channel (OIMAC) with per-user average or peak power constraint. For the average power constrained OIMAC, our bounds at high power are…

Information Theory · Computer Science 2019-08-29 Jing Zhou , Wenyi Zhang

We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the…

Information Theory · Computer Science 2010-07-20 Di Li , Changchuan Yin , Changhai Chen , Shuguang Cui

Cognitive radios have been studied recently as a means to utilize spectrum in a more efficient manner. This paper focuses on the fundamental limits of operation of a MIMO cognitive radio network with a single licensed user and a single…

Information Theory · Computer Science 2009-11-13 Sriram Sridharan , Sriram Vishwanath

We describe a bound on the degree of the generators for some adjoint rings on surfaces and threefolds.

Algebraic Geometry · Mathematics 2018-06-20 Paolo Cascini , De-Qi Zhang

Irregular repetition slotted aloha (IRSA) is a massive random access protocol which can be used to serve a large number of users while achieving a packet loss rate (PLR) close to zero. However, if the number of users is too high, then the…

Information Theory · Computer Science 2023-02-27 Chirag Ramesh Srivatsa , Chandra R. Murthy

Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…

Dynamical Systems · Mathematics 2016-05-25 Cao Zhao , Ercai Chen

In this paper we present a finite-length analysis of frameless ALOHA for a k multi-user detection scenario, i.e., assuming the receiver can resolve collisions of size k or smaller. The analysis is obtained via a dynamical programming…

Information Theory · Computer Science 2017-01-01 Francisco Lazaro , Cedomir Stefanovic

Assuming a network of infinite extent, several researchers have analyzed small-cell networks using a Poisson point process (PPP) location model, leading to simple analytic expressions. The general assumption has been that these results…

Information Theory · Computer Science 2015-12-11 S. Alireza Banani , Andrew W. Eckford , Raviraj S. Adve

In this paper, we study the throughput and delay performances of the slotted Aloha with batch service, which has wide applications in random access networks. Different from the classical slotted Aloha, each node in the slotted Aloha with…

Performance · Computer Science 2019-10-17 Huanhuan Huang , Tong Ye , Tony T. Lee

We study a nonlinear fiber optical channel impaired by cross-phase modulation and dispersion from the viewpoint of an interference channel. We characterize an outer bound on the capacity region of simultaneously achievable rate pairs,…

Information Theory · Computer Science 2021-07-06 Viswanathan Ramachandran , Astrid Barreiro , Gabriele Liga , Alex Alvarado

Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…

Algebraic Geometry · Mathematics 2026-05-25 Juan García Escudero

In this paper we provide a complete proof for a bound on the growth of multi-recurrences which are defined over a number field. The proven bound was already stated by van der Poorten and Schlickewei forty years ago.

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

Let $A$ be a positive operator on a complex Hilbert space $\mathcal{H}.$ We present inequalities concerning upper and lower bounds for $A$-numerical radius of operators, which improve on and generalize the existing ones, studied recently in…

Functional Analysis · Mathematics 2024-08-13 Pintu Bhunia , Kallol Paul , Raj Kumar Nayak

We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coefficients of some rational functions in a unified approach.…

Combinatorics · Mathematics 2023-01-06 Yanni Pei , Yaling Wang , Yi Wang

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Number Theory · Mathematics 2018-10-03 Min Sha

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

In many wireless communication networks a common channel is shared by multiple users who must compete to gain access to it. The operation of the network by self-interested and strategic users usually leads to the overuse of the channel…

Computer Science and Game Theory · Computer Science 2012-11-16 Luca Canzian , Yuanzhang Xiao , Michele Zorzi , Mihaela van der Schaar