English
Related papers

Related papers: Unequal Error Protection in Coded Slotted ALOHA

200 papers

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 present a framework for the analysis of the error floor of coded slotted ALOHA (CSA) for finite frame lengths over the packet erasure channel. The error floor is caused by stopping sets in the corresponding bipartite graph, whose…

Information Theory · Computer Science 2015-01-27 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Petar Popovski

In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation…

Information Theory · Computer Science 2016-11-15 Enrico Paolini , Gianluigi Liva , Marco Chiani

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

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

We consider framed slotted Aloha where $m$ base stations cooperate to decode messages from $n$ users. Users and base stations are placed uniformly at random over an area. At each frame, each user sends multiple replicas of its packet…

Information Theory · Computer Science 2014-01-28 Dusan Jakovetic , Dragana Bajovic , Dejan Vukobratovic , Vladimir Crnojevic

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

This paper proposes an improvement of the random multiple access scheme for satellite communication named Multislot coded ALOHA (MuSCA). MuSCA is a generalization of Contention Resolution Diversity Slotted ALOHA (CRDSA). In this scheme,…

Information Theory · Computer Science 2012-07-04 Huyen Chi Bui , Jérôme Lacan , Marie-Laure Boucheret

We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and…

Information Theory · Computer Science 2016-05-26 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Petar Popovski

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

We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…

Information Theory · Computer Science 2016-11-15 Cedomir Stefanovic , Petar Popovski , Dejan Vukobratovic

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 study a form of unequal error protection that we term "unequal message protection" (UMP). The message set of a UMP code is a union of $m$ disjoint message classes. Each class has its own error protection requirement, with some classes…

Information Theory · Computer Science 2014-05-06 Yanina Y. Shkel , Vincent Y. F. Tan , Stark C. Draper

In this work, we provide a simple yet tight analytical approximation of the packet loss rate in the error floor region for a non-orthogonal multiple access (NOMA)-based irregular repetition slotted ALOHA (IRSA) scheme. Considering an…

Emerging Technologies · Computer Science 2026-01-05 Estefanía Recayte

The bit-wise unequal error protection problem, for the case when the number of groups of bits $\ell$ is fixed, is considered for variable length block codes with feedback. An encoding scheme based on fixed length block codes with erasures…

Information Theory · Computer Science 2020-01-03 Baris Nakiboglu , Siva K. Gorantla , Lizhong Zheng , Todd P. Coleman

Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming a system of linear equations. Different systems of linear…

Information Theory · Computer Science 2015-02-16 Shenghao Yang , Yi Chen , Soung Chang Liew , Lizhao You

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-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of…

Information Theory · Computer Science 2016-06-08 G. Interdonato , S. Pfletschinger , F. Vazquez-Gallego , J. Alonso-Zarate , G. Araniti

In this paper, an improved ALOHA-based unsourced random access (URA) scheme is proposed in MIMO channels. The channel coherent interval is divided into multiple sub-slots and each active user selects several sub-slots to send its codeword,…

Information Theory · Computer Science 2025-05-06 Linjie Yang , Pingzhi Fan , Zhiguo Ding , Jingqiu Gao

We consider ALOHA and slotted ALOHA protocols as medium access rules for a multi-channel message delivery system. Users decide randomly and independently with a minimal amount of knowledge about the system at random times to make a message…

Probability · Mathematics 2023-01-20 Wolfgang König , Charles Kwofie
‹ Prev 1 2 3 10 Next ›