Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
MiSTA: An Age-Optimized Slotted ALOHA Protocol
Download
index.pdf
Date
2022-09-01
Author
Ahmetoglu, Mutlu
Yavascan, Orhan Tahir
Uysal, Elif
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
48
views
25
downloads
Cite This
We introduce minislotted threshold ALOHA (MiSTA), a slotted ALOHA modification designed to minimize the network-wide time average Age of Information (AoI). In MiSTA, sources whose ages are below a certain threshold stay silent. A node with the age above the threshold becomes active in the next time frame with a certain probability. The active node first transmits a short control sequence in a minislot ahead of actual data transmission, and if collision is sensed, it backs off with a certain probability. We derive the steady-state distribution of the number of active sources and analyze its limiting behavior. We show that MiSTA probabilistically converges to a "thinned" slotted ALOHA, where the number of active users at steady state adjusts to optimize age. With an optimal selection of parameters, MiSTA achieves an AoI scaling with the number of sources, n, as 0.9641n, which is an improvement over the threshold ALOHA policy proposed earlier (for which the lowest possible scaling is 1.4169n). While achieving this reduction in age, MiSTA also increases the theoretically achievable throughput to approximately 53 %, from the 37% achievable by threshold ALOHA and regular slotted ALOHA.
Subject Keywords
Age of information (AoI)
,
minislots
,
random access
,
slotted ALOHA
,
stabilized ALOHA
,
threshold ALOHA (TA)
,
threshold policy
,
RANDOM-ACCESS
,
INFORMATION
URI
https://hdl.handle.net/11511/99694
Journal
IEEE INTERNET OF THINGS JOURNAL
DOI
https://doi.org/10.1109/jiot.2022.3179132
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Analysis of Slotted ALOHA With an Age Threshold
Yavascan, Orhan Tahir; Uysal, Elif (2021-05-01)
We present a comprehensive steady-state analysis of threshold-ALOHA, a distributed age-aware modification of slotted ALOHA proposed in recent literature. In threshold-ALOHA, each terminal suspends its transmissions until the Age of Information (AoI) of the status update flow it is sending reaches a certain threshold G. Once the age exceeds G, the terminal attempts transmission with constant probability t in each slot, as in standard slotted ALOHA. We analyze the time-average expected AoI attained by this po...
QUERY AGE OF INFORMATION IN COMMUNICATION NETWORKS
Ildız, Muhammed Emrullah; Uysal, Elif; Department of Electrical and Electronics Engineering (2002-8-22)
We study a pull-based status update communication model where a source node submits update packets to a channel with random transmission delay, at times requested by a remote destination node. The objective is to minimize the average query-age-of-information (QAoI), defined as the age of information (AoI) measured at query instants that occur at the destination side according to a stochastic arrival process. In reference to a push-based problem formulation defined in the literature where the source decides ...
Optimizing Information Freshness in Random Access Channels
Yavaşcan, Orhan Tahir; Uysal, Elif; Department of Electrical and Electronics Engineering (2022-8-31)
In this work, a number of transmission strategies aimed at optimizing information freshness in random access channels are developed and studied. Threshold-ALOHA, an age-aware modification of slotted ALOHA, suggests a fixed age threshold on the terminals before they can become active and attempt transmissions with a constant probability. Threshold ALOHA nearly halves the average Age of Information (AoI) whilst the loss of throughput compared to slotted ALOHA is less than one percent. Mumista, multiple mini s...
Path verification in software-defined networks using programmable data planes
Bostan, Hakan; Onur, Ertan; Department of Computer Engineering (2022-1)
Software-Defined Networks (SDNs) revamp the traditional network architectures by segregating the data plane and control plane and introducing a programmable and log- ically centralized control plane. Although SDNs bring along extensive improvements, as well as solutions to some of the network security problems, the security of SDN itself is often overlooked. Especially the security of the data plane is often overlooked because of the widespread assumption that the data plane devices are trusted. How- ever, ...
Dual-band InGaAs nBn photodetectors at 2 mu m
Şahin, Alper; Gül, Musa Selim; Uzgur, Fatih; Kocaman, Serdar (2022-02-01)
An nBn type InGaAs photodetector structure operating at 2 mu m with dual-band operation capability has been numerically designed and experimentally characterized. A compositionally graded and unintentionally doped InGaAlAs layer with a delta-doped nano-layer behaves as the barrier for majority carrier flow. The pixels fabricated with a 20 mu m pitch mesa process yielded peak quantum efficiencies of 67% and 53% without anti-reflective coating for the e-SWIR and SWIR sides, respectively. Dark current measurem...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Ahmetoglu, O. T. Yavascan, and E. Uysal, “MiSTA: An Age-Optimized Slotted ALOHA Protocol,”
IEEE INTERNET OF THINGS JOURNAL
, vol. 9, no. 17, pp. 15484–15496, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/99694.