A truncated-HARQ based random access protocol for wireless slotted ALOHA MIMO systems

2010 ◽  
Author(s):  
Nejah Missaoui ◽  
Ines Kammoun ◽  
Mohamed Siala
Keyword(s):  
Mimo Systems ◽  
Random Access ◽  
Slotted Aloha ◽  
Access Protocol ◽  
Random Access Protocol

scholarly journals A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems

2017 ◽  
Vol 16 (4) ◽  
pp. 2220-2234 ◽  
Author(s):  
Emil Bjornson ◽  
Elisabeth de Carvalho ◽  
Jesper H. Sorensen ◽  
Erik G. Larsson ◽  
Petar Popovski
Keyword(s):  
Massive Mimo ◽  
Mimo Systems ◽  
Random Access ◽  
Access Protocol ◽  
Pilot Allocation ◽  
Random Access Protocol

scholarly journals A High-Throughput Random Access Protocol for Multiuser MIMO Systems

2008 ◽  
Vol 2008 ◽  
pp. 1-5 ◽  
Author(s):  
Haiyou Guo ◽  
Honglin Hu ◽  
Yan Zhang
Keyword(s):  
High Throughput ◽  
Mimo Systems ◽  
Multiple Input Multiple Output ◽  
Random Access ◽  
Spatial Multiplexing ◽  
Access Protocol ◽  
Random Access Protocol ◽  
Input Multiple Output ◽  
Stable Throughput ◽  
Analytical Result

We propose a high-throughput random access protocol for2×2multiuser multiple-input multiple-output (MIMO) systems. The cross-layer mechanism utilizes the packets combining technique to exploit the advantages of both spatial multiplexing and multipacket reception. Analytical result indicates that the proposed scheme achieves 0.669 per spatial degree of freedom in stable throughput, which is much higher than those in the existed studies.

scholarly journals Collision-aware distributed detection with population-splitting algorithms

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Seksan Laitrakun
Keyword(s):  
Single Channel ◽  
Random Access ◽  
Transmission Probability ◽  
Distributed Detection ◽  
Sensor Nodes ◽  
Final Decision ◽  
Slotted Aloha ◽  
Splitting Algorithm ◽  
Access Protocol ◽  
Random Access Protocol

AbstractWe consider the design of distributed detection algorithms for single-hop, single-channel wireless sensor networks in which sensor nodes send their local decisions to a fusion center (FC) by using a random access protocol. There is also limited time to collect local decisions before a final decision must be made. We thus propose and analyze a modified random access protocol in which the FC combines slotted ALOHA with a population-splitting algorithm called population-splitting-based random access (PSRA) and collision-aware distributed detection according to an estimate-then-fuse approach. Under the PSRA, only sensor nodes whose observations fall in a particular range of reliability will send their decisions in a specific frame by using slotted ALOHA. At the end of the collection time, the FC applies the collision-aware distributed detection to make a final decision. Here, the FC will first observe the state of each time slot—idle, successful, collision—in each frame, use this information to estimate the number of sensor nodes participating in each frame, and, then, compute a final decision using a population-based fusion rule. An approximation of the optimal transmission probability of the slotted ALOHA is determined to minimize the probability of error. Numerical results show that, unlike slotted-ALOHA-based data networks, the transmission probability maximizing the number of successful time slots does not optimize the performance of the proposed distributed detection. Instead, the proposed distributed detection performs best with a transmission probability that induces many collisions.

Sign in / Sign up

Export Citation Format

Share Document