Analysis of Slotted ALOHA With an Age Threshold
Orhan Tahir Yavascan,Elif Uysal +1 more
TLDR
In this paper, the authors presented a comprehensive steady-state analysis of threshold-ALOHA, a distributed age-aware modification of slotted ALOHA proposed in recent literature, and analyzed the time-average expected AoI attained by this policy, and explored its scaling with network size.Abstract:
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 $\Gamma $ . Once the age exceeds $\Gamma $ , the terminal attempts transmission with constant probability $\tau $ in each slot, as in standard slotted ALOHA. We analyze the time-average expected AoI attained by this policy, and explore its scaling with network size, $n$ . We derive the probability distribution of the number of active users at steady state, and show that as network size increases the policy converges to one that runs slotted ALOHA with fewer sources: on average about one fifth of the users is active at any time. We obtain an expression for steady-state expected AoI and use this to optimize the parameters $\Gamma $ and $\tau $ , resolving the conjectures in previous literature by confirming that the optimal age threshold and transmission probability are $2.2n$ and $4.69/n$ , respectively. We find that the optimal AoI scales with the network size as $1.4169n$ , which is almost half the minimum AoI achievable with slotted ALOHA, while the loss from the maximum throughput of $e^{-1}$ remains below 1%. We compare the performance of this rudimentary algorithm to that of the SAT policy [2] that dynamically adapts its transmission probabilities.read more
Citations
More filters
Journal ArticleDOI
Age of Information and Throughput in Random Access-Based IoT Systems With Periodic Updating
Yun Han Bae,Jung Woo Baek +1 more
TL;DR: A random access-based Internet of Things (IoT) system with periodic update generation and state-dependent slotted Aloha is considered, and an analytical model is proposed to derive the average AoI, peak AoI and system throughput.
Journal ArticleDOI
Monitoring Real-Time Status of Analog Sources: A Cross-Layer Approach
Shaoling Hu,Wei Chen +1 more
TL;DR: In this paper, a cross-layer optimization is formulated to jointly control the lossy compression in the application layer and data transmission in the physical layer, which substantially reduces the protocol complexity in practice.
Journal ArticleDOI
Spatiotemporal Analysis for Age of Information in Random Access Networks Under Last-Come First-Serve With Replacement Protocol
TL;DR: In this article , the authors investigate the AoI in the context of random access networks, in which transmitters need to send a sequence of information packets to the intended receivers over a shared spectrum.
Proceedings ArticleDOI
The Role of Feedback in AoI Optimization Under Limited Transmission Opportunities
TL;DR: In this paper , the authors investigate the optimal schedule of updates over a finite time horizon for a resource-constrained sensor that is allowed to perform a limited number of updates, as typical of IoT devices.
Proceedings ArticleDOI
Analysis of Age-Aware Slotted ALOHA
Orhan Tahir Yavascan,Elif Uysal +1 more
TL;DR: In this paper, a steady-state analysis of threshold-ALOHA, a distributed age-aware modification of slotted ALOHA is presented, where nodes whose ages exceed the threshold attempt transmission with a fixed probability in each slot.
References
More filters
Proceedings ArticleDOI
Real-time status: How often should one update?
TL;DR: A time-average age metric is employed for the performance evaluation of status update systems and the existence of an optimal rate at which a source must generate its information to keep its status as timely as possible at all its monitors is shown.
Journal ArticleDOI
Update or Wait: How to Keep Your Data Fresh
TL;DR: In this paper, the authors study how to optimally manage the freshness of information updates sent from a source node to a destination via a channel and develop efficient algorithms to find the optimal update policy among all causal policies and establish sufficient and necessary conditions for the optimality of the zero-wait policy.
Journal ArticleDOI
The Age of Information: Real-Time Status Updating by Multiple Sources
Roy D. Yates,Sanjit K. Kaul +1 more
TL;DR: An age of information timeliness metric is formulated and a general result for the AoI that is applicable to a wide variety of multiple source service systems is derived that makes AoI evaluation to be comparable in complexity to finding the stationary distribution of a finite-state Markov chain.
Journal ArticleDOI
Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
TL;DR: In this article, the authors consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels and formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network.
Proceedings ArticleDOI
Age of information under energy replenishment constraints
TL;DR: An effective online heuristic, Balance Updating (BU), that achieves performance close to an omniscient (offline) policy is proposed and simulations indicate that they can significantly improve the age over greedy approaches.