Time aware closed form frame slotted ALOHA frame length optimization

2016 ◽  
Author(s):  
Hazem A. Ahmed ◽  
Hamed Salah ◽  
Joerg Robert ◽  
Albert Heuberger
Keyword(s):  
Closed Form ◽  
Slotted Aloha ◽  
Frame Length ◽  
Length Optimization ◽  
Time Aware

A Time and Capture Probability Aware Closed Form Frame Slotted ALOHA Frame Length Optimization

2015 ◽  
Vol 19 (11) ◽  
pp. 2009-2012 ◽  
Author(s):  
Hamed Salah ◽  
Hazem A. Ahmed ◽  
Joerg Robert ◽  
Albert Heuberger
Keyword(s):  
Closed Form ◽  
Capture Probability ◽  
Slotted Aloha ◽  
Frame Length ◽  
Length Optimization

A Kind of Enhanced Slotted ALOHA Algorithm for Anti-Collision in RFID System

2013 ◽  
Vol 756-759 ◽  
pp. 3497-3500
Author(s):  
Fan Wei Meng ◽  
Yue Zhao ◽  
Cui Hong Ma ◽  
You Liang Yang
Keyword(s):  
Real Time ◽  
System Performance ◽  
Conflict Situation ◽  
Point Of View ◽  
Slotted Aloha ◽  
Mathematical Point ◽  
Frame Length ◽  
Time Estimates ◽  
Rfid System ◽  
Framed Slotted Aloha

in the RFID system, the conflict caused by the multi-label has been affecting system performance. This paper proposed a grouping dynamic framed slotted ALOHA algorithm based on the analysis of ALOHA algorithm. According to the conflict situation, to make real-time estimates the number of tags on the dynamic framed slotted ALOHA algorithm from the mathematical point of view, Dynamically change the frame length or the labels are grouped to reduce the label probability of collisions, thereby improving the efficiency of the recognition.

scholarly journals Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis

2017 ◽  
Vol 65 (2) ◽  
pp. 651-662 ◽  
Author(s):  
Mikhail Ivanov ◽  
Fredrik Brannstrom ◽  
Alexandre Graell i Amat ◽  
Petar Popovski
Keyword(s):  
Slotted Aloha ◽  
Frame Length ◽  
Finite Frame ◽  
Length Analysis

scholarly journals Peak age of information in slotted ALOHA network

2021 ◽  
Author(s):  
Sepehr Asvadi ◽  
Farid Ashtiani
Keyword(s):  
Closed Form ◽  
Analytical Model ◽  
Discrete Time ◽  
Transmission Delay ◽  
Slotted Aloha ◽  
Achievable Throughput ◽  
Simulation Results ◽  
Age Of Information

<p>In this paper, we concentrate on the peak age of information (PAoI) in a discrete-time slotted ALOHA network comprised of <i>M</i> buffer-less nodes, capable of keeping just one packet at each time. In this network, whenever some nodes transmit their packets simultaneously, a collision happens, thus there is interaction among queues and transmission delay of a packet might prolong more than one slot. The packets are generated at each node stochastically and independently. The nodes follow preemptive queueing policy. In this network, we propose a new trellis-based analytical model to represent the interaction among queues and derive exact average PAoI in closed form. Furthermore, we find average PAoI-constrained regions and minimize average PAoI for a symmetric network, numerically. As a byproduct of our analysis, the achievable throughput region of two slotted ALOHA networks with unlimited buffer and buffer-less nodes are compared. We observe that the latter is superior not only in AoI, but also in achievable throughput region. Simulation results confirm our analysis.</p>

scholarly journals Peak age of information in slotted ALOHA network

2021 ◽  
Author(s):  
Sepehr Asvadi ◽  
Farid Ashtiani
Keyword(s):  
Closed Form ◽  
Analytical Model ◽  
Discrete Time ◽  
Transmission Delay ◽  
Slotted Aloha ◽  
Achievable Throughput ◽  
Simulation Results ◽  
Age Of Information

<p>In this paper, we concentrate on the peak age of information (PAoI) in a discrete-time slotted ALOHA network comprised of <i>M</i> buffer-less nodes, capable of keeping just one packet at each time. In this network, whenever some nodes transmit their packets simultaneously, a collision happens, thus there is interaction among queues and transmission delay of a packet might prolong more than one slot. The packets are generated at each node stochastically and independently. The nodes follow preemptive queueing policy. In this network, we propose a new trellis-based analytical model to represent the interaction among queues and derive exact average PAoI in closed form. Furthermore, we find average PAoI-constrained regions and minimize average PAoI for a symmetric network, numerically. As a byproduct of our analysis, the achievable throughput region of two slotted ALOHA networks with unlimited buffer and buffer-less nodes are compared. We observe that the latter is superior not only in AoI, but also in achievable throughput region. Simulation results confirm our analysis.</p>

Sign in / Sign up

Export Citation Format

Share Document