相关论文: High-Throughput Random Access via Codes on Graphs

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…

Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical URA setting, a small subset of active devices within a very…

Enabling autonomous driving and industrial automation with wireless networks poses many challenges, which are typically abstracted through reliability and latency requirements. One of the main contributors to latency in cellular networks is…

Machine-type communication services in mobile cel- lular systems are currently evolving with an aim to efficiently address a massive-scale user access to the system. One of the key problems in this respect is to efficiently identify active…

Machine-type communication (MTC) has been extensively studied to provide connectivity for devices and sensors in the Internet-of-Thing (IoT). Thanks to the sparse activity, random access, e.g., ALOHA, is employed for MTC to lower signaling…

The annihilating filter-based low-rank Hankel matrix approach (ALOHA) is one of the state-of-the-art compressed sensing approaches that directly interpolates the missing k-space data using low-rank Hankel matrix completion. The success of…

Responding to the "datacenter tax" and "killer microseconds" problems for datacenter applications, diverse solutions including Smart NIC-based ones have been proposed. Nonetheless, they often suffer from high overhead of communications over…

We present a stochastic geometry-based model to investigate alternative medium access choices for LoRaWAN---a widely adopted low-power wide-area networking (LPWAN) technology for the Internet-of-things (IoT). LoRaWAN adoption is driven by…

Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are…

We introduce a neural-network architecture, termed the constrained recurrent sparse autoencoder (CRsAE), that solves convolutional dictionary learning problems, thus establishing a link between dictionary learning and neural networks.…

This paper provides proofs of the rate stability, Harris recurrence, and epsilon-optimality of CSMA algorithms where the backoff parameter of each node is based on its backlog. These algorithms require only local information and are easy to…

The ergodic rate performance and limits of orthogonal frequency-division multiple access (OFDMA) cognitive radios (CRs) is studied under imperfect cross-link knowledge. We propose a novel stochastic interference management and exploitation…

Low-Rank Adaptation (LoRA) has emerged as a widely adopted technique in text-to-image models, enabling precise rendering of multiple distinct elements, such as characters and styles, in multi-concept image generation. However, current…

The share of the top 500 supercomputers with NVIDIA GPUs is now over 25% and continues to grow. While fault tolerance is a critical issue for supercomputing, there does not currently exist an efficient, scalable solution for CUDA…

The cellular Internet-of-Things has resulted in the deployment of millions of machine-type communication (MTC) devices. These massive number of devices must communicate with a single gNodeB (gNB) via the random access channel (RACH)…

We consider a mixed analog-to-digital converter (ADC) based architecture consisting of high-precision and one-bit ADCs with the antenna-varying threshold for direction of arrival (DOA) estimation using a uniform linear array (ULA), which…

This paper studies the buffered Aloha with K-exponential backoff collision resolution algorithms. The buffered Aloha network is modeled as a multi-queue single-server system. We adopt a widely used approach in packet switching systems to…

This paper presents CRESM, a novel collision resolution method for decoding collided packets in random-access wireless networks. In a collision, overlapping signals from several sources are received simultaneously at a receiver. CRESM…

The Random Sequential Adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here…

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…