Related papers: Multi-Channel Random Access with Replications
Random access is a multiple access communication protocol where the users simultaneously communicate with a base station (BS) in an uncoordinated fashion. In this work, we consider the problem of multiuser detection in a random access…
In wireless networks relay nodes can be used to assist the users' transmissions to reach their destination. Work on relay cooperation, from a physical layer perspective, has up to now yielded well-known results. This paper takes a different…
Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission,…
In this paper, we consider the issue of covert communications with random access protocol. We consider that the legitimate user Bob has no priori knowledge about packet arrival time and thus employs data-aided frame detection based on…
In the Internet-of-Things (IoT), random access is employed for devices to share a common access channel in packet transmission with low signaling overhead. Although a retransmission strategy is necessary for packet collision resolution, it…
This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…
We study the multi-terminal remote estimation problem under a rate constraint, in which the goal of the encoder is to help each decoder estimate a function over a certain distribution -- while the distribution is known only to the encoder,…
Multicasting is an efficient technique for simultaneously transmitting common messages from the base station (BS) to multiple mobile users (MUs). Multicast scheduling over multiple channels, which aims to jointly minimize the energy…
We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…
Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs. Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to…
Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. However, in Machine-Type Communications (MTC), some users are likely to…
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…
In this paper, we propose a channel assortment strategy for Reliable Communication in Multi-Hop Cognitive Radio Networks.
In mMTC mode, with thousands of devices trying to access network resources sporadically, the problem of random access (RA) and collisions between devices that select the same resources becomes crucial. A promising approach to solve such an…
Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…
In recent years there is a growing effort to provide learning algorithms for spectrum collaboration. In this paper we present a medium access control protocol which allows spectrum collaboration with minimal regret and high spectral…
In order to follow up with mission-critical applications, new features need to be carried to satisfy a reliable communication with reduced latency. With this regard, this paper proposes a low latency cooperative transmission scheme, where…
In this paper, we analyze the delay performance of an ad-hoc dynamic network where random network coding and broadcast are used in combination to distribute the messages. The analysis is comprehensive for that we consider M-to-N broadcast…
We consider ALOHA and slotted ALOHA protocols as medium access rules for a multi-channel message delivery system. Users decide randomly and independently with a minimal amount of knowledge about the system at random times to make a message…
In this paper, we address the average consensus problem of multi-agent systems over wireless networks. We propose a distributed average consensus algorithm by invoking the concept of over-the-air aggregation, which exploits the signal…