English
Related papers

Related papers: Finite-Length Analysis of Frameless ALOHA with Mul…

200 papers

In this paper we present an exact finite-length analysis of frameless ALOHA that is obtained through a dynamical programming approach. Monte Carlo simulations are performed in order to verify the analysis. Two examples are provided that…

Information Theory · Computer Science 2016-11-22 Francisco Lázaro , Čedomir Stefanović

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational…

Information Theory · Computer Science 2020-07-07 Francisco Lázaro , Čedomir Stefanović , Petar Popovski

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards…

Information Theory · Computer Science 2017-09-08 Cedomir Stefanovic , Francisco Lazaro , Petar Popovski

Herein, we consider the problem of cooperative multi-access in the presence of overlapped coverage areas. Assuming a frameless ALOHA transmission scheme, we derive exact analytical throughput expressions for throughput in the aforementioned…

Information Theory · Computer Science 2018-08-21 Shun Ogata , Koji Ishibashi , Giuseppe Abreu

Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a…

Information Theory · Computer Science 2013-08-08 Cedomir Stefanovic , Petar Popovski

We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson random process and, in contrast to standard frame synchronous…

Information Theory · Computer Science 2016-11-29 Erik Sandgren , Alexandre Graell i Amat , Fredrik Brännström

A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmissions occur in a time-slotted ALOHA-type fashion but with an important…

Networking and Internet Architecture · Computer Science 2015-05-14 Xin Liu , John Kountouriotis , Athina P. Petropulu , Kapil R. Dandekar

Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling…

Information Theory · Computer Science 2017-07-03 Jasper Goseling , Cedomir Stefanovic , Petar Popovski

The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by…

Information Theory · Computer Science 2013-07-02 Cedomir Stefanovic , Petar Popovski

We analyze the performance of coded slotted ALOHA systems for a scenario where users have different error protection requirements and correspondingly can be divided into user classes. The main goal is to design the system so that the…

Information Theory · Computer Science 2016-09-20 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Gianluigi Liva

In Dynamic-Frame Aloha subsequent frame lengths must be optimally chosen to maximize throughput. When the initial population size ${\cal N}$ is known, numerical evaluations show that the maximum efficiency is achieved by setting the frame…

Information Theory · Computer Science 2016-11-15 Luca Barletta , Flaminio Borgonovo , Matteo Cesana

We consider a frame-asynchronous coded slotted ALOHA (FA-CSA) system where users become active according to a Poisson random process. In contrast to standard frame-synchronous CSA (FS-CSA), users transmit a first replica of their message in…

Information Theory · Computer Science 2016-06-15 Erik Sandgren , Alexandre Graell i Amat , Fredrik Brännström

ALOHA is one of the most basic Medium Access Control (MAC) protocols and represents a foundation for other more sophisticated distributed and asynchronous MAC protocols, e.g., CSMA. In this paper, unlike in the traditional work that focused…

Performance · Computer Science 2009-02-27 Predrag R. Jelenkovic , Jian Tan

We analyze multiuser detection under the assumption that the number of users accessing the channel is unknown by the receiver. In this environment, users' activity must be estimated along with any other parameters such as data, power, and…

Information Theory · Computer Science 2016-11-15 Adrià Tauste Campo , Albert Guillén i Fàbregas , Ezio Biglieri

A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The…

Information Theory · Computer Science 2018-03-06 Alexandre Graell i Amat , Gianluigi Liva

In this paper, the problem of using uncoordinated multiple access (UMA) to serve a massive amount of heterogeneous users is investigated. Leveraging the heterogeneity, we propose a novel UMA protocol, called iterative collision resolution…

Information Theory · Computer Science 2020-12-25 Yu-Chih Huang , Shin-Lin Shieh , Yu-Pin Hsu , Hao-Ping Cheng

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

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

The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design…

Information Theory · Computer Science 2016-11-17 Cedomir Stefanovic , Miyu Momoda , Petar Popovski

Multiple connected devices sharing common wireless resources might create interference if they access the channel simultaneously. Medium access control (MAC) protocols gener- ally regulate the access of the devices to the shared channel to…

Information Theory · Computer Science 2016-07-11 Konstantinos Dovelos , Laura Toni , Pascal Frossard
‹ Prev 1 2 3 10 Next ›