Related papers: Identifying Randomly Activated Users via Sign-Comp…
In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of…
Massive machine-type communication (mMTC) has been regarded as one of the most important use scenarios in the fifth generation (5G) and beyond wireless networks, which demands scalable access for a large number of devices. While grant-free…
To account for the massive uncoordinated random access scenario, which is relevant for the Internet of Things, Polyanskiy (2017) proposed a novel formulation of the multiple-access problem, commonly referred to as unsourced multiple access,…
This paper considers an uplink massive machine-type communication (mMTC) scenario, where a large number of user devices are connected to a base station (BS). A novel grant-free massive random access (MRA) strategy is proposed, considering…
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…
In this paper, we investigate the random access problem for a delay-constrained heterogeneous wireless network. As a first attempt to study this new problem, we consider a network with two users who deliver delay-constrained traffic to an…
The requirements to support massive connectivity and low latency in massive Machine Type Communications (mMTC) bring a huge challenge in the design of its random access (RA) procedure, which usually calls for efficient joint active user…
In this paper we introduce a new class of codes for over-loaded synchronous wireless CDMA systems which increases the number of users for a fixed number of chips without introducing any errors. In addition these codes support active user…
This paper introduces a random multiple access method for satellite communications, named Network Coding-based Slotted Aloha (NCSA). The goal is to improve diversity of data bursts on a slotted-ALOHA-like channel thanks to error correcting…
Identification and authentication are two basic functionalities of traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is…
Graphs of developer networks are important for software engineering research and practice. For these graphs to realistically represent the networks, accurate developer identities are imperative. We aim to identify developer identity errors…
Session identification is a common strategy used to develop metrics for web analytics and behavioral analyses of user-facing systems. Past work has argued that session identification strategies based on an inactivity threshold is inherently…
This paper proposes a computationally efficient algorithm to solve the joint data and activity detection problem for massive random access with massive multiple-input multiple-output (MIMO). The BS acquires the active devices and their data…
The massiveness of devices in crowded Machine-to-Machine (M2M) communications brings new challenges to existing random-access (RA) schemes, such as heavy signaling overhead and severe access collisions. In order to reduce the signaling…
We analyze multiuser detection under the assumption that the number of users accessing the channel is unknown by the receiver. In this environment, users' activity must be estimated along with any other parameters such as data, power, and…
Many applications in cellular systems and sensor networks involve a random subset of a large number of users asynchronously reporting activity to a base station. This paper examines the problem of multiuser detection (MUD) in random access…
Random Access (RA) Medium Access (MAC) protocols are simple and effective when the nature of the traffic is unpredictable and random. In the following paper, a novel RA protocol called Enhanced Contention Resolution ALOHA (ECRA) is…
Grant-free random access and uplink non-orthogonal multiple access (NOMA) have been introduced to reduce transmission latency and signaling overhead in massive machine-type communication (mMTC). In this paper, we propose two novel…
We present a framework for random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode,…
Massive MTC support is an important future market segment, but not yet efficiently supported in cellular systems. In this paper we follow-up on recent concepts combining advanced MAC protocols with Compressed Sensing (CS) based multiuser…