اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMiSTA: An Age-Optimized Sotted ALOHA Protocol
56
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce Mini Slotted Threshold-ALOHA (MiSTA), a slotted ALOHA modification designed to minimize the time average Age of Information (AoI) achieved in the network while also increasing throughput. In MiSTA, sources with age below a certain threshold stay silent. Nodes with age above the threshold that decide to transmit test the channel for possible collisions during a mini-slot placed ahead of each data slot. We derive the steady state distribution of the number of active sources and analyze its limiting behaviour. We show that MiSTA probabilistically converges to thinned slotted ALOHA, where the number of active users at steady state adjusts to optimize age. With an optimal selection of parameters, the AoI scales with the network size (i.e. the number of sources), n, as 0.9641n, in contrast to 1.4169n which is the lowest possible scaling with Threshold-ALOHA proposed in earlier literature. While achieving this reduction in age, MiSTA also increases achievable throughput to approximately 53%, from the 37% achievable by Threshold-ALOHA and regular slotted ALOHA.
قيم البحث
اقرأ أيضاً
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 cite{doga} 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 that dynamically adapts its transmission probabilities.
Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming a system of linear equations. Different systems of linear equations ar
e recovered in different timeslots. A message decoder then recovers the original packets of all the users by jointly solving multiple systems of linear equations obtained over different timeslots. We propose the batched BP decoding algorithm that combines belief propagation (BP) and local Gaussian elimination. Compared with pure Gaussian elimination decoding, our algorithm reduces the decoding complexity from cubic to linear function of the number of users. Compared with the ordinary BP decoding algorithm for low-density generator-matrix codes, our algorithm has better performance and the same order of computational complexity. We analyze the performance of the batched BP decoding algorithm by generalizing the tree-based approach and provide an approach to optimize the system performance.
In this paper, we design a new polar slotted ALOHA (PSA) protocol over the slot erasure channels, which uses polar coding to construct the identical slot pattern (SP) assembles within each active user and base station. A theoretical analysis framewor
k for the PSA is provided. First, by using the packet-oriented operation for the overlap packets when they conflict in a slot interval, we introduce the packet-based polarization transform and prove that this transform is independent of the packets length. Second, guided by the packet-based polarization, an SP assignment (SPA) method with the variable slot erasure probability (SEP) and a SPA method with a fixed SEP value are designed for the PSA scheme. Then, a packet-oriented successive cancellation (pSC) and a pSC list (pSCL) decoding algorithm are developed. Simultaneously, the finite-slots throughput bounds and the asymptotic throughput for the pSC algorithm are analyzed. The simulation results show that the proposed PSA scheme can achieve an improved throughput with the pSC/SCL decoding algorithm over the traditional repetition slotted ALOHA scheme.
Multiple connected devices sharing common wireless resources might create interference if they access the channel simultaneously. Medium access control (MAC) protocols gener- ally regulate the access of the devices to the shared channel to limit sign
al interference. In particular, irregular repetition slotted ALOHA (IRSA) techniques can achieve high-throughput performance when interference cancellation methods are adopted to recover from collisions. In this work, we study the finite length performance for IRSA schemes by building on the analogy between successive interference cancellation and iterative belief- propagation on erasure channels. We use a novel combinatorial derivation based on the matrix-occupancy theory to compute the error probability and we validate our method with simulation results.
In this paper, we introduce the Age of Incorrect Information (AoII) as an enabler for semantics-empowered communication, a newly advocated communication paradigm centered around datas role and its usefulness to the communications goal. First, we shed
light on how the traditional communication paradigm, with its role-blind approach to data, is vulnerable to performance bottlenecks. Next, we highlight the shortcomings of several proposed performance measures destined to deal with the traditional communication paradigms limitations, namely the Age of Information (AoI) and the error-based metrics. We also show how the AoII addresses these shortcomings and captures more meaningfully the purpose of data. Afterward, we consider the problem of minimizing the average AoII in a transmitter-receiver pair scenario where packets are sent over an unreliable channel subject to a transmission rate constraint. We prove that the optimal transmission strategy is a randomized threshold policy, and we propose a low complexity algorithm that finds both the optimal threshold and the randomization parameter. Furthermore, we provide a theoretical comparison between the AoII framework and the standard error-based metrics counterpart. Interestingly, we show that the AoII-optimal policy is also error-optimal for the adopted information source model. At the same time, the converse is not necessarily true. Finally, we implement our proposed policy in various real-life applications, such as video streaming, and we showcase its performance advantages compared to both the error-optimal and the AoI-optimal policies.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
