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 2024Show all

12 papers · 1 filter

cs.CR2024

Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory

Mustafa Doger, Sennur Ulukus, Nail Akar

Theoretical guarantees for double spending probabilities for the Nakamoto consensus under the -deep confirmation rule have been extensively studied for zero/bounded network dela…

cs.IT2024

Joint Age-State Belief is All You Need: Minimizing AoII via Pull-Based Remote Estimation

Ismail Cosandal, Sennur Ulukus, Nail Akar

Age of incorrect information (AoII) is a recently proposed freshness and mismatch metric that penalizes an incorrect estimation along with its duration. Therefore, keeping track of…

cs.IT2024

Scheduling Policies in a Multi-Source Status Update System with Dedicated and Shared Servers

Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

Use of multi-path network topologies has become a prominent technique to assert timeliness in terms of age of information (AoI) and to improve resilience to link disruptions in com…

cs.IT2024

Modeling Interfering Sources in Shared Queues for Timely Computations in Edge Computing Systems

Nail Akar, Melih Bastopcu, Sennur Ulukus +1

Most existing stochastic models on age of information (AoI) focus on a single shared server serving status update packets from sources where each packet update stream is Pois…

cs.IT2024

Multi-Threshold AoII-Optimum Sampling Policies for CTMC Information Sources

Ismail Cosandal, Nail Akar, Sennur Ulukus

We study push-based sampling and transmission policies for a status update system consisting of a general finite-state continuous-time Markov chain (CTMC) information source with k…

cs.IT2024

Cyclic Scheduler Design for Minimizing Age of Information in Massive Scale Networks Susceptible to Packet Errors

Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

In multi-source status update systems, sources need to be scheduled appropriately to maintain timely communication between each of the sources and the monitor. A cyclic schedule is…

cs.CR2024

PoW Security-Latency under Random Delays and the Effect of Transaction Fees

Mustafa Doger, Sennur Ulukus, Nail Akar

Safety guarantees and security-latency problem of Nakamoto consensus have been extensively studied in the last decade with a bounded delay model. Recent studies have shown that PoW…

cs.IT2024

Age of Information in a Single-Source Generate-at-Will Dual-Server Status Update System

Nail Akar, Sennur Ulukus

We study age of information (AoI) in a single-source dual-server status update system for the generate at will (GAW) scenario, consisting of an information source, dual servers, an…

cs.IT2024

AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraints

Ismail Cosandal, Nail Akar, Sennur Ulukus

We consider a sensor that samples an -state continuous-time Markov chain (CTMC)-based information source process, and transmits the observed state of the source, to a remote mon…

cs.IT2024★ 1 cited

Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers

Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar

In a communication setting where multiple sources share a single channel to provide status updates to a remote monitor, source transmissions need to be scheduled appropriately to m…

cs.IT2024

Modeling AoII in Push- and Pull-Based Sampling of Continuous Time Markov Chains

Ismail Cosandal, Nail Akar, Sennur Ulukus

Age of incorrect information (AoII) has recently been proposed as an alternative to existing information freshness metrics for real-time sampling and estimation problems involving…

cs.IT2024

Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems

Nail Akar, Sahan Liyanaarachchi, Sennur Ulukus

We study cyclic scheduling for generate-at-will (GAW) multi-source status update systems with heterogeneous service times and packet drop probabilities, with the aim of minimizing…