相关论文: Slotted Aloha for Networked Base Stations with Spa…

In this paper, we consider the coded-caching broadcast network with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. We propose a centralized coded…

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…

Hinging on ideas from physical-layer network coding, some promising proposals of coded random access systems seek to improve system performance (while preserving low complexity) by means of packet repetitions and decoding of linear…

In this paper, we consider the problem of calculating the stability region and average delay of two user slotted ALOHA over a Gilbert-Elliott channel, where users have channel state information and adapt their transmission probabilities…

In this paper, a new framework for optimizing the resource allocation in a millimeter-wave-non-orthogonal multiple access (mmWave-NOMA) communication for crowded venues is proposed. MmWave communications suffer from severe blockage caused…

This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot,…

Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed in [1] as a probabilistic framework for…

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…

We study a delay-constrained grant-free random access system with a multi-antenna base station. The users randomly generate data packets with expiration deadlines, which are then transmitted from data queues on a first-in first-out basis.…

This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length…

In this paper, we propose a novel decentralized framework for optimizing the transmission strategy of Irregular Repetition Slotted ALOHA (IRSA) protocol in sensor networks. We consider a hierarchical communication framework that ensures…

Supporting massive device transmission is challenging in Machine-to-Machine (M2M) communications. Particularly, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn causes high…

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value,…

We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…

Wireless sensor networks are usually composed of a large number of nodes, and with the increasing processing power and power consumption efficiency they are expected to run more complex protocols in the future. These pose problems in the…

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational…

We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds…

Based on the two decision variables, service location and base station selection, construct a computational model of the switching delay, communication delay, and queuing delay patterns of a mobile edge computing system in each time…

This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a…

In this paper, we develop a probabilistic framework for analyzing coded random access. Our framework is based on a new abstract receiver (decoder), called a Poisson receiver, that is characterized by a success probability function of a…