Related papers: Coded Random Access: Applying Codes on Graphs to D…
We investigate the age-of-information (AoI) in the context of random access networks, in which transmitters need to send a sequence of information packets to the intended receivers over a shared spectrum. Due to interference, the dynamics…
In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA…
An interference management problem among multiple overlapped random access networks (RANs) is investigated, each of which operates with slotted ALOHA protocol. Assuming that access points and users have multiple antennas, a novel…
The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model…
Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particular attractive as it…
An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the…
ALOHA-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of…
In a wireless network the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Previously, connectivity in wireless networks was analyzed using static geometric graphs, and as we show leads to an…
In this paper, the problem of using uncoordinated multiple access (UMA) to serve a massive amount of heterogeneous users is investigated. Leveraging the heterogeneity, we propose a novel UMA protocol, called iterative collision resolution…
In this paper, we explore the use of machine learning methods as an efficient alternative to correlation in performing packet detection. Targeting satellite-based massive machine type communications and internet of things scenarios, our…
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…
With the rapid expansion of the Internet of Things, the efficient sharing of the wireless medium by a large amount of simple transmitters is becoming essential. Scheduling-based solutions are inefficient for this setting, where small data…
In this letter, we develop a converse bound on the asymptotic load threshold of coded slotted ALOHA (CSA) schemes with K-multi packet reception capabilities at the receiver. Density evolution is used to track the average probability of…
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…
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
This paper studies low-power random access protocols for timely status update systems with information freshness requirements, measured by age of information (AoI). In an extensive network, a fundamental challenge is scheduling a large…
We study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a number of protocols with impressive error performance have…
This work aims at combining adaptive protocol design, utility maximization and stochastic geometry. We focus on a spatial adaptation of Aloha within the framework of ad hoc networks. We consider quasi-static networks in which mobiles learn…
Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing can root back to the network information theory. For generations of wireless communication systems design, orthogonal multiple access (OMA) schemes in time,…
We investigate the age-of-information (AoI) in the context of random access networks, in which transmitters need to send a sequence of information packets to intended receivers over shared spectrum. We establish an analytical framework that…