activity
20232026
most citedMinimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers

1 citations · 3 across the 28 of their papers we have counts for

collaborators
Showing 2026Show all

10 papers · 1 filter

cs.CR2026

Capital Costs Protect the Network: Mining Gap Dynamics in Proof-of-Work Blockchains Under a Stochastic Mempool

Hasan Selçuk Kılıç, Nail Akar

Proof-of-Work blockchains increasingly rely on transaction fees to keep miners engaged as block subsidies decline. An immediate outcome of this is that miners may sit idle at the s…

cs.IT2026

Minimizing Age of Incorrect Information in Pull-Based Remote Estimation of a Markov Source

Ismail Cosandal, Sennur Ulukus, Nail Akar

In this paper, we consider a discrete-time pull-based remote estimation system involving an information source and a remote monitor where the information source is a finite-state i…

cs.IT2026

Distribution of Age of Information in the Erlang Loss System

Nail Akar, Sennur Ulukus

In this paper, we study the exact distributions of the age of information (AoI) and peak AoI (PAoI) in a bufferless setting in which time-stamped updates, or processed tasks, gener…

cs.IT2026

Squeezing the Most Out of Preemption for AoI Minimization: Single-source Case

Nail Akar, Mohammad Moltafet, Sennur Ulukus +2

In this work, we study a single-source single-server continuous-time status update system where the updates arrive according to a Poisson process and update service times are gener…

cs.IT2026

Dual-Regime Absorbing Markov Chain Theory in Remote Estimation: Age-Minimizing Push Policies

Ismail Cosandal, Sennur Ulukus, Nail Akar

For a remote estimation system, we study the optimization of age of incorrect information (AoII), which is a recently proposed semantic-aware information freshness metric. In parti…

cs.IT2026

When and Which Sensor to Observe? Timely Tracking of a Joint Markov Source

Ismail Cosandal, Sennur Ulukus, Nail Akar

We investigate the problem of remote estimation (at a monitor) of a discrete-time joint Markov process with individual components which can be observed with dedicated sensors. At a…

cs.IT2026

Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization

Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

The study of optimal preemption policies for status update systems has been a recurring topic in the age of information (AoI) literature, where threshold-based structures have been…

cs.IT2026

Beyond Martingale Estimators: Structured Estimators for Maximizing Information Freshness in Query-Based Update Systems

Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

This paper investigates information freshness in a remote estimation system in which the remote information source is a continuous-time Markov chain (CTMC). For such systems, estim…

cs.IT2026

Multi-Stage Structured Estimators for Information Freshness

Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

Most of the contemporary literature on information freshness solely focuses on the analysis of freshness for martingale estimators, which simply use the most recently received upda…

cs.IT2026

Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems

Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

Query-based sampling has become an increasingly popular technique for monitoring Markov sources in pull-based update systems. However, most of the contemporary literature on this a…