Related papers: Multi-Channel Random Access with Replications
We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and…
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
In this work, we analyze the throughput of random access multi-user relay-assisted millimeter-wave wireless networks, in which both the destination and the relay have multipacket reception capability. We consider a full-duplex network…
We consider a multipoint-to-point network in which sensors periodically send measurements to a gateway. The system uses Long Range (LoRa) communications in a frequency band with duty-cycle limits. Our aim is to enhance the reliability of…
This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary…
In this paper we study the long-term throughput performance of repetition protocols coupled with power control for multiple access block-fading channels. We propose to use the feedback bits to inform the transmitter about the decoding…
We consider a single-hop ad hoc network in which each node aims to broadcast packets to its neighboring nodes by using multiple slotted, TDD collision channels. There is no cooperation among the nodes. To ensure successful broadcast, we…
In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure…
In this paper we focus on a feedback mechanism for unsourced random access (URA) communications. We propose an algorithm to construct feedback packets broadcasted to the users by the base station (BS) as well as the feedback packet format…
We consider an ad hoc network where multiple users access the same set of channels. The channel characteristics are unknown and could be different for each user (heterogeneous). No controller is available to coordinate channel selections by…
We consider a half-duplex wireless relay network with hybrid-automatic retransmission request (HARQ) and Rayleigh fading channels. In this paper, we analyze the outage probability of the multi-relay delay-limited HARQ system with…
In this paper, we consider the ChannelComp framework, where multiple transmitters aim to compute a function of their values at a common receiver while using digital modulations over a multiple access channel. ChannelComp provides a general…
We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in multicarrier access networks. We study the case where CSI is partially overheard by mobiles and one…
The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The…
We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and…
We study the optimal routing on multilayered communication networks, which are composed of two layers of subnetworks. One is a wireless network, and the other is a wired network. We develop a simple recurrent algorithm to find an optimal…
Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer…
We consider distributed channel access in multi-hop cognitive radio networks. Previous works on opportunistic channel access using multi-armed bandits (MAB) mainly focus on single-hop networks that assume complete conflicts among all…
In future wireless networks, one fundamental challenge for massive machine-type communications (mMTC) lies in the reliable support of massive connectivity with low latency. Against this background, this paper proposes a compressive sensing…
We consider a lossy multicast network in which the reliability is provided by means of Random Linear Network Coding. Our goal is to characterise the performance of such network in terms of the probability that a source message is delivered…