2 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 2 / 2
Yayın Improving age of information in random access channels(Institute of Electrical and Electronics Engineers Inc., 2020-07) Atabay, Doğa Can; Uysal, Elif; Kaya, OnurWe study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario where multiple transmissions result in collision, we propose a threshold-based lazy version of Slotted ALOHA and derive the time average AoI achieved by this policy. We demonstrate that the average AoI performance of the lazy policy is significantly better than Slotted ALOHA, and close to the ideal round robin benchmark.Yayın When to pull data for minimum age penalty(IEEE, 2021-10-18) Yavaşcan, Orhan Tahir; Ceran, Elif Tuğçe; Cakir, Zeynep; Uysal, Elif; Kaya, OnurA communication receiver that wants to pull data from a remote sensor by exploiting wireless energy transfer is considered. The receiver has a long-term average energy budget for this operation, and its goal is to keep the time average of a general age penalty function as small as possible. The channel from the source to the receiver is a two-state (ON/OFF) communication link whose state is IID or Markovian, and known instantaneously by the receiver. Modeling the problem as a constrained Markov decision problem, we obtain a randomized threshold-based decision policy that achieves the minimum possible average age penalty. We determine the optimal time average Age of Information and age violation probabilities by exploiting the optimality of the derived policy.
