English
Related papers

Related papers: Irregular Repetition Slotted ALOHA Over the Binary…

200 papers

This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot,…

Information Theory · Computer Science 2020-01-13 Sang-Woon Jeon , Hu Jin

Accommodating the needs of a large number of diverse users in the Internet of Things (IoT), notably managing how the users access the common channel, has posed unique challenges to the network designers. In this paper, we study a…

Networking and Internet Architecture · Computer Science 2016-05-31 Moslem Noori , Samira Rahimian , Masoud Ardakani

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…

Networking and Internet Architecture · Computer Science 2014-05-27 Tanveer Ahmad , Yan tian feng

Network-coded slotted ALOHA (NCSA) is a re- finement to the classic slotted ALOHA protocol which im- proves throughput by enabling multiple source transmissions per ALOHA slot using physical-layer network coding (PNC). The receiver detects…

Information Theory · Computer Science 2015-12-10 Terry Ferrett , Matthew C. Valenti

In this article, we consider a random access scheme for an indoor Internet of Things (IoT) framework that uses optical wireless communication (OWC). We focus on a Slotted ALOHA (SA)-based solution where a number of OWC IoT users contend to…

Information Theory · Computer Science 2021-07-16 Milica Petkovic , Tijana Devaja , Dejan Vukobratovic , Francisco J. Escribano , Cedomir Stefanovic

In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access…

Information Theory · Computer Science 2015-05-05 Dong Min Kim , Seong-Lyun Kim

Various random access mechanisms, such as Aloha protocol and its corresponding variants have been widely studied as efficient methods to coordinate the medium access among competing users. But when two or more wireless users transmit…

Information Theory · Computer Science 2015-01-07 Zaaloul Abdellah , Haqiq Abdelkrim

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…

Information Theory · Computer Science 2012-10-03 Čedomir Stefanović , Kasper F. Trilingsgaard , Nuno K. Pratas , Petar Popovski

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…

Information Theory · Computer Science 2016-11-17 Cedomir Stefanovic , Miyu Momoda , Petar Popovski

We study the problem of unsourced random access (URA) over Rayleigh block-fading channels with a receiver equipped with multiple antennas. We propose a slotted structure with multiple stages of orthogonal pilots, each of which is randomly…

Information Theory · Computer Science 2023-07-17 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman

One of the main problems in WIMAX is to share the medium by multiple users who compete for access. Various random access mechanisms, such as ALOHA and its corresponding variations have been widely studied as efficient methods to coordinate…

Information Theory · Computer Science 2015-01-06 Abdellah Zaaloul , Mohamed Ben El Aattar , Mohamed Hanini , Abdelkrim Haqiq , Mohammed Boulmalaf

This work derives bounds on the jamming capacity of a slotted ALOHA system. A system with n legitimate users, each with a Bernoulli arrival process is considered. Packets are temporarily stored at the corresponding user queues, and a…

Information Theory · Computer Science 2008-08-06 Sandeep Bhadra , Shreeshankar Bodas , Sanjay Shakkottai , Sriram Vishwanath

We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an upper bound on the decoding error probability of a…

Information Theory · Computer Science 2010-02-22 Idan Goldenberg , David Burshtein

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce…

Information Theory · Computer Science 2022-02-17 Xinyu Xie , Yongpeng Wu , Jianping An , Junyuan Gao , Wenjun Zhang , Chengwen Xing , Kai-Kit Wong , Chengshan Xiao

Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained…

Information Theory · Computer Science 2022-06-23 Lei Deng , Danzhou Wu , Jing Deng , Po-Ning Chen , Yunghsiang S. Han

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards…

Information Theory · Computer Science 2017-09-08 Cedomir Stefanovic , Francisco Lazaro , Petar Popovski

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…

Information Theory · Computer Science 2017-08-15 Linlin Zhao , Xuefen Chi , Shaoshi Yang

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…

Information Theory · Computer Science 2017-10-13 Cedomir Stefanovic , Enrico Paolini , Gianluigi Liva

In this paper, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…

Networking and Internet Architecture · Computer Science 2014-01-16 Andrea Munari , Michael Heindlmaier , Gianluigi Liva , Matteo Berioli

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…

Information Theory · Computer Science 2016-04-20 Karine Zidane , Jérome Lacan , Mathieu Gineste , Caroline Bes , Arnaud Deramecourt , Mathieu Dervin
‹ Prev 1 3 4 5 6 7 10 Next ›