English
Related papers

Related papers: A Model of Random Multiple Access in Unlicensed Sp…

200 papers

Non-orthogonal multiple access (NOMA) has been considered as a promising solution for improving the spectrum efficiency of next-generation wireless networks. In this paper, the performance of a p-persistent slotted ALOHA system in support…

Networking and Internet Architecture · Computer Science 2020-02-25 Ziru Chen , Yong Liu , Sami Khairy , Lin X. Cai , Yu Cheng , Ran Zhang

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

Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained…

Information Theory · Computer Science 2022-06-23 Lei Deng , Danzhou Wu , Jing Deng , Po-Ning Chen , Yunghsiang S. Han

A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the same message to all directly reachable nodes. Secondly, a…

Networking and Internet Architecture · Computer Science 2018-01-03 Bogdan S. Chlebus

This work derives bounds on the jamming capacity of a slotted ALOHA system. A system with n legitimate users, each with a Bernoulli arrival process is considered. Packets are temporarily stored at the corresponding user queues, and a…

Information Theory · Computer Science 2008-08-06 Sandeep Bhadra , Shreeshankar Bodas , Sanjay Shakkottai , Sriram Vishwanath

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…

Information Theory · Computer Science 2017-05-15 Olga Galinina , Andrey Turlikov , Sergey Andreev , Yevgeni Koucheryavy

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…

Information Theory · Computer Science 2025-07-17 Sergey Foss , Dmitriy Kim , Andrey Turlikov

We investigate the age-of-information (AoI) in the context of random access networks, in which transmitters need to send a sequence of information packets to intended receivers over shared spectrum. We establish an analytical framework that…

Information Theory · Computer Science 2020-09-22 Howard H. Yang , Ahmed Arafa , Tony Q. S. Quek , H. Vincent Poor

This work introduces a new perspective for physical media sharing in multiuser communication by jointly considering (i) the meaning of the transmitted message and (ii) its function at the end user. Specifically, we have defined a scenario…

We consider a multi-channel communication system under ALOHA and CSMA protocols, resepctively, in continuous time. We derive probabilistic formulas for the most important quantities: the numbers of sending attempts and the number of…

Probability · Mathematics 2022-12-19 Wolfgang König , Helia Shafigh

We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-division multiple access. We assume that each user spreads its…

Information Theory · Computer Science 2024-06-11 Mert Ozates , Mohammad Kazemi , Tolga M. Duman

In ALOHA-type packetized network, the transmission times of packets follow a stochastic process. In this paper, we advocate a deterministic approach for channel multiple-access. Each user is statically assigned a periodic protocol signal,…

Information Theory · Computer Science 2009-09-29 Kenneth W. Shum , Chi Wan Sung

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

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

A massive MIMO system, represented by a base station with hundreds of antennas, is capable of spatially multiplexing many devices and thus naturally suited to serve dense crowds of wireless devices in emerging applications, such as…

Information Theory · Computer Science 2017-09-06 Elisabeth de Carvalho , Emil Björnson , Jesper H. Sørensen , Erik G. Larsson , Petar Popovski

We propose a probabilistic handshake mechanism for all-to-all broadcast coded slotted ALOHA. We consider a fully connected network where each user acts as both transmitter and receiver in a half-duplex mode. Users attempt to exchange…

Information Theory · Computer Science 2015-04-20 Mikhail Ivanov , Petar Popovski , Fredrik Brannstrom , Alexandre Graell i Amat , Cedomir Stefanovic

In conventional backscatter communication (BackCom) systems, time division multiple access (TDMA) and frequency division multiple access (FDMA) are generally adopted for multiuser backscattering due to their simplicity in implementation.…

Information Theory · Computer Science 2025-03-10 Bowen Gu , Dong Li , Hao Xie , Kan Yu , Quansheng Guan , Yongjun Xu

The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet…

Information Theory · Computer Science 2015-02-05 Alessio Meloni , Maurizio Murroni

We consider the unsourced random access problem with multiple receivers and propose a cell-free type solution for that. In our proposed scheme, the active users transmit their signals to the access points (APs) distributed in a geographical…

Emerging Technologies · Computer Science 2025-01-20 Mert Ozates , Mohammad Kazemi , Eduard Jorswieck , Deniz Gunduz

We study the problem of unsourced random access (URA) over Rayleigh block-fading channels with a receiver equipped with multiple antennas. We employ multiple stages of orthogonal pilots, each of which is randomly picked from a codebook. In…

Information Theory · Computer Science 2022-05-20 Mohammad Javad Ahmadi , Tolga M. Duman