arXiv subjects

Andrey Turlikov

Publications and source records attributed to Andrey Turlikov.

6 recordsLinked to original sources

arXiv2025

Efficient Remote Monitoring through Noisy Random Access with Retransmissions

We consider a rare event monitoring system consisting of a set of devices and a base station, where devices transmit information about rare events to the base station using a random multiple access scheme. We introduce a model in which the presence of noise in the multiple access channel can cause message loss even in the absence of transmission collisions. The occurrence of events is modeled by a family of independent two-state Markov chains (with states 0 and 1). We analyze how repeated transmissions affect system performance. Two efficiency criteria are proposed and studied: the maximum probability that a message about an event from a fixed device is successfully delivered to the base station and the maximum frequency at which the base station successfully receives updates about the entire system. For each criterion, we determine the optimal number of retransmissions as a function of the system parameters.

cs.IT↗

arXiv2018

Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC

We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds are derived. The main difference of this scheme in comparison to IRSA is as follows: any collisions of order up to T can be resolved with some probability of error introduced by noise. In order to optimize the parameters of the scheme we combine the density evolution method (DE) proposed by G. Liva and a finite length random coding bound for the Gaussian MAC proposed by Y. Polyanskiy. As energy efficiency is of critical importance for massive machine-type communication (mMTC), then our main goal is to minimize the energy-per-bit required to achieve the target packet loss ratio (PLR). We consider two scenarios: (a) the number of active users is fixed; (b) the number of active users is a Poisson random variable.

cs.IT↗

arXiv2017

Spatial random multiple access with multiple departure

We introduce a new model of spatial random multiple access systems with a non-standard departure policy: all arriving messages are distributed uniformly on a finite sphere in the space, and when a successful transmission of a single message occurs, the transmitted message leaves the system together with all its neighbours within a ball of a given radius centred at the message's location. We consider three classes of protocols: centralised protocols and decentralised protocols with either ternary or binary feedback; and analyse their stability. Further, we discuss some asymptotic properties of stable protocols.

cs.NI↗

arXiv2017

Multi-Channel Random Access with Replications

This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a lower estimate for the access delay performance within this class. Further, we propose a feasible access control algorithm achieving low access delay by sending multiple message replicas, which approaches the performance of the hypothetical algorithm. The resulting performance is readily approximated by a simple lower bound, which is derived for a large number of channels.

cs.IT↗

arXiv2016

Stability of a Random Multiple Access Channel with "Success-Failure" Feedback

We consider a model of a decentralized multiple access system with a non-standard binary feedback where the empty and collision situations cannot be distinguished. We show that, like in the case of a ternary feedback, for any input rate λ< 1/e, there exists a "doubly randomized" adaptive transmission protocol which stabilizes the behavior of the system. We discuss also a number of related problems and formulate some hypotheses.

math.PR↗

arXiv2016

Stability and instability of a random multiple access model with adaptive energy harvesting

We introduce a model for the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). We assume in addition that there is an energy harvesting mechanism, and any message transmission requires a unit of energy. Units of energy arrive randomly and independently of anything else. We analyse stability and instability conditions for this model.

math.PR↗