English
Related papers

Related papers: On Frame Asynchronous Coded Slotted ALOHA: Asympto…

200 papers

With the ever-growing demand for low-latency services in machine-to-machine (M2M) communications, the delay performance of random access networks has become a primary concern, which critically depends on the sensing capability of nodes. To…

Networking and Internet Architecture · Computer Science 2024-06-06 Xinran Zhao , Lin Dai

Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per…

Information Theory · Computer Science 2023-12-12 Manuel Fernández-Veiga , M. E. Sousa-Vieira , Ana Fernández-Vilas , Rebeca P Díaz-Redondo

Recent studies have numerically demonstrated the possible advantages of the asynchronous non-orthogonal multiple access (ANOMA) over the conventional synchronous non-orthogonal multiple access (NOMA). The ANOMA makes use of the oversampling…

Information Theory · Computer Science 2019-02-22 Xun Zou , Biao He , Hamid Jafarkhani

We consider a random access network consisting of source-destination pairs. Each source node generates status updates and transmits this information to its intended destination over a shared spectrum. The goal is to minimize the…

Networking and Internet Architecture · Computer Science 2023-07-18 Zhiling Yue , Howard H. Yang , Meng Zhang , Nikolaos Pappas

Machine-to-Machine (M2M) communication is now playing a market-changing role in a wide range of business world. However, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn…

Information Theory · Computer Science 2016-11-18 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang

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

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

Supporting massive device transmission is challenging in Machine-to-Machine (M2M) communications. Particularly, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn causes high…

Information Theory · Computer Science 2012-08-16 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang

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

Information aging has gained prominence in characterizing communication protocols for timely remote estimation and control applications. This work proposes an Age of Information (AoI)-aware threshold-based dynamic frame slotted ALOHA…

Networking and Internet Architecture · Computer Science 2024-01-04 Masoumeh Moradian , Aresh Dadlani , Ahmad Khonsari , Hina Tabassum

Grant Free Random Access (GFRA) is a popular protocol in the Internet of Things (IoT) to reduce the control signaling. GFRA is a framed protocol where each frame is split into two parts: device identification; and data transmission part…

Information Theory · Computer Science 2024-07-29 Alix Jeannerot , Malcolm Egan , Jean-Marie Gorce

Despite being the subject of a growing body of research, non-orthogonal multiple access has failed to garner sufficient support to be included in modern standards. One of the more promising approaches to non-orthogonal multiple access is…

Signal Processing · Electrical Eng. & Systems 2024-10-28 Dylan Wheeler , Erin E. Tripp , Balasubramaniam Natarajan

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…

Information Theory · Computer Science 2018-11-20 Anton Glebov , Nikolay Matveev , Kirill Andreev , Alexey Frolov , Andrey Turlikov

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

Network-coded slotted ALOHA (NCSA) is a re- finement to the classic slotted ALOHA protocol which im- proves throughput by enabling multiple source transmissions per ALOHA slot using physical-layer network coding (PNC). The receiver detects…

Information Theory · Computer Science 2015-12-10 Terry Ferrett , Matthew C. Valenti

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

In this paper, we propose a Slotted ALOHA (SA)-inspired solution for an indoor optical wireless communication (OWC)-based Internet of Things (IoT) system. Assuming that the OWC receiver exploits the capture effect, we are interested in the…

Networking and Internet Architecture · Computer Science 2022-11-17 Tijana Devaja , Milica Petkovic , Francisco J. Escribano , Cedomir Stefanovic , Dejan Vukobratovic

Recent studies have demonstrated the superiority of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in cooperative communication networks. In this paper, we propose a novel half-duplex cooperative asynchronous…

Information Theory · Computer Science 2019-02-22 Xun Zou , Mehdi Ganji , Hamid Jafarkhani

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

We study the asymptotic performance of two multi-hop overlaid ad-hoc networks that utilize the same temporal, spectral, and spatial resources based on random access schemes. The primary network consists of Poisson distributed legacy users…

Networking and Internet Architecture · Computer Science 2013-06-05 Armin Banaei , Costas N. Georghiades , Shuguang Cui