Related papers: High-Throughput Random Access via Codes on Graphs
We study medium access in FMCW radar networks. We assume that all the radars use same parameters, e.g., chirp duration, chirp slope, cutoff frequency, number of chirps per packet, etc, and propose and analyze slotted ALOHA and CSMA…
The efficiency of tag identification in an RFID system can be low down due to the tag collision problems. the tag collision problem occurs when a reader try to read multiple tags in an interrogation zone. as a result the reader does not…
Multiple connected devices sharing common wireless resources might create interference if they access the channel simultaneously. Medium access control (MAC) protocols gener- ally regulate the access of the devices to the shared channel to…
In this paper, we study a layered random access scheme based on non-orthogonal multiple access (NOMA) to improve the throughput of multichannel ALOHA. At a receiver, successive interference cancellation (SIC) is carried out across layers to…
We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…
Random Access MAC protocols are simple and effective when the nature of the traffic is unpredictable and sporadic. In the following paper, investigations on the new Enhanced Contention Resolution ALOHA (ECRA) are presented, where some new…
A framework for the analysis of synchronous grant-free massive multiple access schemes based on the irregular repetition slotted ALOHA (IRSA) protocol and operating over the Gaussian multiple access channel is presented. IRSA-based schemes…
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…
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…
In this paper, we design a novel high-throughput random access scheme for an indoor optical wireless communication (OWC) massive Internet of Things (IoT) scenario. Due to the large density of both IoT devices and OWC access points (APs), we…
Multi-replicA decoding using corRelation baSed LocALisAtion (MARSALA) is a recent random access technique designed for satellite return links. It follows the multiple transmission and interference cancellation scheme of Contention…
Irregular repetition slotted aloha (IRSA) is a massive random access protocol which can be used to serve a large number of users while achieving a packet loss rate (PLR) close to zero. However, if the number of users is too high, then the…
There is a paucity of random access protocols designed for alleviating collisions in visible light communication (VLC) systems, where carrier sensing is hard to be achieved due to the directionality of light. To resolve the problem of…
In the recent past, new enhancements based on the well established Aloha technique (CRDSA, CRDSA++, IRSA) have demonstrated the capability to reach higher throughput than traditional SA, in bursty traffic conditions and without any need of…
The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design…
In this letter we motivate the need to revisit the MAC protocol used in Gen2 RFID system in order to leverage receiver structures with Collision Recovery capabilities at the PHY layer. To this end we propose to consider a simple variant of…
Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC) decoding have received significant attention lately due to their ability to dramatically increase the throughput of traditional SA. Motivated by increased density…
In this paper we treat the problem of identification of a subset of active users in a set of a large number of potentially active users. The users from the subset are activated randomly, such that the access point (AP) does not know the…
Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…
In this paper, we for the first time investigate the random access problem for a delay-constrained heterogeneous wireless network. We begin with a simple two-device problem where two devices deliver delay-constrained traffic to an access…