Improving Age of Information in Random Access Channels

Atabay, Doga Can
Uysal, Elif
Kaya, Onur
We 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.


Measuring age of information on real-life connections
Beytur, Hasan Burhan; Baghaee, Sajjad; Uysal, Elif (2019-04-01)
Age of Information (AoI) is a relatively new metric to measure freshness of networked application such as real-time monitoring of status updates or control. The AoI metric is discussed in the literature mainly in a theoretical way. In this work, we want to point out the issues related to the measuring AoI-related values, such as synchronization and calculation of the values. We discussed the effect of synchronization error in the measurement and a solution for calculating an estimate of average AoI without ...
Optimization of an online course with web usage mining
Akman, LE; Akkan, B; Baykal, Nazife (2004-02-18)
The huge amount of information existing in the World Wide Web constitutes an ideal environment to implement data mining techniques. Web mining is the mining of web data. There are different applications of web mining: web content mining, web structure mining and web usage mining. In our study we analyzed an online course by web usage mining techniques in order to optimize the navigation paths, the duration of the time spend on each page and the number of visits throughout the semester of the course. Moreove...
Optimizing Multipath Routing With Guaranteed Fault Tolerance in Internet of Things
Hasan, Mohammed Zaki; Al-Turjman, Fadi (2017-10-01)
Internet of Things (IoTs) refers to the rapidly growing network of connected objects and people that are able to collect and exchange data using embedded sensors. To guarantee the connectivity among these objects and people, fault tolerance routing has to be significantly considered. In this paper, we propose a bio-inspired particle multi-swarm optimization (PMSO) routing algorithm to construct, recover, and select k-disjoint paths that tolerates the failure while satisfying the quality of service parameter...
Improved knowledge distillation with dynamic network pruning
Şener, Eren; Akbaş, Emre; Department of Computer Engineering (2019)
Deploying convolutional neural networks to mobile or embedded devices is often prohibited by limited memory and computational resources. This is particularly problematic for the most successful networks, which tend to be very large and require long inference times. In the past, many alternative approaches have been developed for compressing neural networks based on pruning, regularization, quantization or distillation. In this thesis, we propose the Knowledge Distillation with Dynamic Pruning (KDDP), which ...
Efficient index structures for video databases
Açar, Esra; Yazıcı, Adnan; Department of Computer Engineering (2008)
Content-based retrieval of multimedia data has been still an active research area. The efficient retrieval of video data is proven a difficult task for content-based video retrieval systems. In this thesis study, a Content-Based Video Retrieval (CBVR) system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficiently retrieving videos based on low-level features such as color, texture, shape and motion is presented. The system represents low-level features of video data with ...
Citation Formats
D. C. Atabay, E. Uysal, and O. Kaya, “Improving Age of Information in Random Access Channels,” 2020, Accessed: 00, 2021. [Online]. Available: