Related papers: Multi-Class Unsourced Random Access via Coded Demi…
We generalize the type-based multiple access framework proposed by Mergen and Tong (2006) to the case of unsourced multiple access. In the proposed framework, each device tracks the state of a physical/digital process, quantizes this state,…
A multi-level random power transmit strategy that is used in conjunction with a random access protocol (RAP) (e.g. ALOHA, IRSA) is proposed to fundamentally increase the throughput in a distributed communication network. A SIR model is…
Rateless Multiple Access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain…
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…
This work studies the optimization of rate-splitting multiple access (RSMA) transmission technique for a cloud radio access network (C-RAN) downlink system. Main idea of RSMA is to split the message for each user equipment (UE) to private…
We introduce a modulation for unsourced massive random access whereby the transmitted symbols are rank-1 tensors constructed from Grassmannian sub-constellations. The use of a low-rank tensor structure, together with tensor decomposition in…
This paper proposes a unified semi-blind detection framework for sourced and unsourced random access (RA), which enables next-generation ultra-reliable low-latency communications (URLLC) with massive devices. Specifically, the active…
In this paper, we for the first time investigate the random access problem for a delay-constrained heterogeneous wireless network. We begin with a simple two-device problem where two devices deliver delay-constrained traffic to an access…
In this work we demonstrate how a lack of synchronization can in fact be advantageous in the problem of random access. Specifically, we consider a multiple-access problem over a frame-asynchronous 2-user binary-input adder channel in the…
Decentralized machine learning is a promising emerging paradigm in view of global challenges of data ownership and privacy. We consider learning of linear classification and regression models, in the setting where the training data is…
Massive Machine-Type Communications (mMTC) features a massive number of low-cost user equipments (UEs) with sparse activity. Tailor-made for these features, grant-free random access (GF-RA) serves as an efficient access solution for mMTC.…
In this paper, we consider a network of processors aiming at cooperatively solving mixed-integer convex programs subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
The growing volume of unstructured data within organizations poses significant challenges for data analysis and process automation. Unstructured data, which lacks a predefined format, encompasses various forms such as emails, reports, and…
Multi-robot task allocation usually assumes some combination of communication, known task models, or a coordinator. We study the opposite extreme, a regime common in practice but overlooked in theory, which we name Zero-Knowledge MRTA…
Unsupervised Domain Adaptation (UDA) aims to learn a predictor model for an unlabeled domain by transferring knowledge from a separate labeled source domain. However, most of these conventional UDA approaches make the strong assumption of…
We derive an achievability bound to quantify the performance of a type-based unsourced multiple access system -- an information-theoretic model for grant-free multiple access with correlated messages. The bound extends available…
A new non-orthogonal multiple access scheme performing simultaneous transmission to multiple users characterized by different signal-to-noise ratios is proposed. Different users are multiplexed by storing their codewords into a multiplexing…
This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without…
The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…
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,…