English
Related papers

Related papers: Coded Slotted ALOHA: A Graph-Based Method for Unco…

200 papers

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

Information Theory · Computer Science 2023-07-17 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman

Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recovering the original packets from multiple collisions. In this…

Information Theory · Computer Science 2010-01-13 Ali ParandehGheibi , Jay Kumar Sundararajan , Muriel Medard

We develop a framework for communication-control co-design in a wireless networked control system with multiple geographically separated controllers and controlled systems, modeled via a Poisson point process. Each controlled system…

Information Theory · Computer Science 2024-12-02 Gourab Ghatak , Geethu Joseph , Chen Quan

Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-20 Anne-Marie Kermarrec , Erwan Le Merrer , Gilles Straub , Alexandre van Kempen

Conventional power-domain non-orthogonal multiple access (NOMA) relies on precise power control, which requires real-time channel state information at transmitters. This requirement severely limits its application to future wireless…

Information Theory · Computer Science 2020-03-13 Zhaoji Zhang , Ying Li , Guanghui Song , Chau Yuen , Yong Liang Guan

This paper presents a novel graphical approach that counts the number of global 8-cycles on the SCRAM three-layer Tanner graph. SCRAM, which stands for Slotted Coded Random Access Multiplexing, is a joint decoder that is meets challenging…

Information Theory · Computer Science 2024-10-11 Sally Nafie , Joerg Robert , Albert Heuberger

Irregular repetition slotted aloha (IRSA) is a massive random access protocol which can be used to serve a large number of users while achieving a packet loss rate (PLR) close to zero. However, if the number of users is too high, then the…

Information Theory · Computer Science 2023-02-27 Chirag Ramesh Srivatsa , Chandra R. Murthy

In most existing works on non-orthogonal multiple access (NOMA), the decoding order of successive interference cancellation (SIC) is prefixed and based on either the users' channel conditions or their quality of service (QoS) requirements.…

Information Theory · Computer Science 2020-05-21 Z. Ding , R. Schober , H. V. Poor

We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of…

Information Theory · Computer Science 2019-02-28 Jinho Choi

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…

Information Theory · Computer Science 2012-10-03 Čedomir Stefanović , Kasper F. Trilingsgaard , Nuno K. Pratas , Petar Popovski

In-band full-duplex is emerging as a promising solution to enhance throughput in wireless networks. Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree…

Networking and Internet Architecture · Computer Science 2017-09-25 Andrea Munari , Petri Mähönen , Marina Petrova

Applications like environmental sensing, and health and activity sensing, are supported by networks of devices (nodes) that send periodic packet transmissions over the wireless channel to a sink node. We look at simple abstractions that…

Information Theory · Computer Science 2017-05-10 Sanjit K. Kaul , Roy D. Yates

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

The sum rate performance of random-access networks crucially depends on the access protocol and receiver structure. Despite extensive studies, how to characterize the maximum sum rate of the simplest version of random access, Aloha, remains…

Information Theory · Computer Science 2015-12-18 Yitong Li , Lin Dai

In this paper, we study the coexistence of critical and non-critical Internet of Things (IoT) services on a grant-free channel consisting of radio access and backhaul segments. On the radio access segment, IoT devices send packets to access…

Networking and Internet Architecture · Computer Science 2019-09-25 Rahif Kassab , Osvaldo Simeone , Andrea Munari , Federico Clazzer

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

Flanking traditional metrics such as throughput and reliability, age of information (AoI) is emerging as a fundamental tool to capture the performance of IoT systems. In this context, we focus on a setup in which a large number of nodes…

Networking and Internet Architecture · Computer Science 2020-05-19 Andrea Munari , Alexey Frolov

Proliferation of the urban Internet-of-Things (IoTs) for smart cities has fuelled massive amounts of data over wireless cellular networks. Random access (RA) system of wireless cellular networks, e.g., 5G New Radio (NR), based on S-ALOHA…

Information Theory · Computer Science 2024-10-28 Yangqian Hu , Jun-Bae Seo , Hu Jin

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