English
Related papers

Related papers: Deterministic Patterns for Multiple Access with La…

200 papers

We study coded multichannel random access schemes for ultra-reliable low-latency uplink transmissions. We concentrate on non-orthogonal access in the frequency domain, where users transmit over multiple orthogonal subchannels and inter-user…

Information Theory · Computer Science 2019-05-06 Christopher Boyd , Radosław Kotaba , Olav Tirkkonen , Petar Popovski

We examine deterministic broadcasting on multiple-access channels for a scenario when packets are injected continuously by an adversary to the buffers of the devices at rate $\rho$ packages per round. The aim is to maintain system…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-19 Elijah Hradovich , Marek Klonowski , Dariusz R. Kowalski

We consider the distributed channel access problem for a system consisting of multiple control subsystems that close their loop over a shared wireless network. We propose a distributed method for providing deterministic channel access…

Systems and Control · Electrical Eng. & Systems 2024-10-28 Tahmoores Farjam , Henk Wymeersch , Themistoklis Charalambous

In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…

Information Theory · Computer Science 2017-08-04 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We consider a model of a decentralized multiple access system with a non-standard binary feedback where the empty and collision situations cannot be distinguished. We show that, like in the case of a ternary feedback, for any input rate…

Probability · Mathematics 2016-07-12 Sergey Foss , Bruce Hajek , 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

In this article, we introduce iterative deterministic equivalents as a novel technique for the performance analysis of communication systems whose channels are modeled by complex combinations of independent random matrices. This technique…

Information Theory · Computer Science 2011-12-20 Jakob Hoydis , Romain Couillet , Merouane Debbah

In large-scale Internet of things networks, efficient medium access control (MAC) is critical due to the growing number of devices competing for limited communication resources. In this work, we consider a new challenge in which a set of…

Networking and Internet Architecture · Computer Science 2025-11-11 Lorenzo Mario Amorosa , Zhan Gao , Roberto Verdone , Petar Popovski , Deniz Gündüz

In this paper, we investigate optimal coding strategies for a class of linear deterministic relay networks. The network under study is a relay network, with one source, one destination, and two relay nodes. Additionally, there is a…

Information Theory · Computer Science 2010-01-14 S. M. Hossein Tabatabaei Yazdi , Mohammad Reza Aref

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-19 Tomasz Jurdzinski , Dariusz R. Kowalski , Grzegorz Stachowiak

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme…

Information Theory · Computer Science 2013-04-04 Parthajit Mohapatra , Chandra R. Murthy

In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliable connectivity. Sparsity ensures communication overhead…

Social and Information Networks · Computer Science 2025-08-19 Mansi Sood , Eray Can Elumar , Osman Yagan

We study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a number of protocols with impressive error performance have…

Information Theory · Computer Science 2019-05-09 Christopher Boyd , Roope Vehkalahti , Olav Tirkkonen , Antti Laaksonen

Several novel industrial applications involve human control of vehicles, cranes, or mobile robots through various high-throughput feedback systems, such as Virtual Reality (VR) and tactile/haptic signals. The near real-time interaction…

Networking and Internet Architecture · Computer Science 2022-08-26 Andrea Bedin , Federico Chiariotti , Andrea Zanella

Machine-to-machine (M2M) wireless systems aim to provide ubiquitous connectivity between machine type communication (MTC) devices without any human intervention. Given the exponential growth of MTC traffic, it is of utmost importance to…

Information Theory · Computer Science 2016-11-18 Mahyar Shirvanimoghaddam , Mischa Dohler , Sarah J. Johnson

This paper addresses a fundamental limitation of previous random access protocols, their lack of latency performance guarantees. We consider $K$ IoT transmitters competing for uplink resources and we design a fully distributed protocol for…

Networking and Internet Architecture · Computer Science 2019-04-02 Apostolos Destounis , Dimitrios Tsilimantos , Mérouane Debbah , Georgios S. Paschos

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

A multiple access system with bursty data arrivals to the terminals is considered. The users are frame-synchronized, with variable sized packets independently arriving in each slot at every transmitter. Each packet needs to be delivered to…

Information Theory · Computer Science 2016-11-29 Sakshi Kapoor , Sreejith Sreekumar , Sibi Raj B Pillai

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu

We consider capacity maximization in wireless networks under adversarial interference conditions. There are n links, each consisting of a sender and a receiver, which repeatedly try to perform a successful transmission. In each time step,…

Data Structures and Algorithms · Computer Science 2013-07-24 Johannes Dams , Martin Hoefer , Thomas Kesselheim
‹ Prev 1 2 3 10 Next ›