Related papers: The Strongly Asynchronous Massive Access Channel
Distributed medium access control (MAC) protocols are proposed for wireless networks assuming that one-hop peers can periodically exchange a small amount of state information. Each station maintains a state and makes state transitions and…
We consider a Gaussian multiple-access channel (MAC) with an amplify-and-forward (AF) relay, where all nodes except the receiver have multiple antennas and the direct links between transmitters and receivers are neglected. Thus, spatial…
A conflict-avoiding code (CAC) is a deterministic transmission scheme for asynchronous multiple access without feedback. When the number of simultaneously active users is less than or equal to $w$, a CAC of length $L$ with weight $w$ can…
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…
In a cellular Internet of Things, burst transmissions from millions of machine type communications (MTC) devices can result in channel congestion. The main bottleneck in such scenario is inefficient random access channel (RACH) mechanism…
This paper analyzes the spectral efficiency as a function of medium access control (MAC) for large random spreading CDMA random access systems that employ a linear receiver. It is shown that located at higher than the physical layer, MAC…
An asynchronous $\ka$-active-user unsourced multiple access channel (AUMAC) is a key model for uncoordinated massive access in future networks. We focus on a scenario where each transmission is subject to the maximal delay constraint…
Wireless Sensor Networks (WSN) are becoming popular day by day, however one of the main issue in WSN is its limited resources. We have to look to the resources to create Message Authentication Code (MAC) keeping in mind the feasibility of…
This paper focuses on the problem of separately modulating and jointly estimating two independent continuous-valued parameters sent over a Gaussian multiple-access channel (MAC) under the mean square error (MSE) criterion. To this end, we…
This work identifies the fundamental limits of Multi-Access Coded Caching (MACC) where each user is connected to multiple caches in a manner that follows a generalized combinatorial topology. This topology stands out as it allows for…
We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. In this regime, schemes based on sparse superposition coding can achieve a near-optimal tradeoff…
The propagation delay is non-negligible in underwater acoustic networks (UANs) since the propagation speed is five orders of magnitude smaller than the speed of light. In this case, space and time factors are strongly coupled to determine…
We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…
We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…
We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback…
In ALOHA-type packetized network, the transmission times of packets follow a stochastic process. In this paper, we advocate a deterministic approach for channel multiple-access. Each user is statically assigned a periodic protocol signal,…
It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…
In this paper, we examine discrete memoryless Multiple Access Channels (MACs) with two-sided feedback in the presence of two correlated channel states that are correlated in the sense of Slepian-Wolf (SW). We find achievable rate region for…
Reliable communication is a challenge in a very noisy RF channel further corrupted by severe, multiple narrowband interference. Code Division Multiple Access (CDMA) is a widely used method to both mitigate such interference and support…
This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four…