Vishrant Tripathi
YOU?
Author Swipe
View article: Using Age of Information for Throughput Optimal Spectrum Sharing
Using Age of Information for Throughput Optimal Spectrum Sharing Open
We consider a spectrum sharing problem where two users attempt to communicate over N channels. The Primary User (PU) has prioritized transmissions and its occupancy on each channel over time can be modeled as a Markov chain. The Secondary …
View article: AoI-based Scheduling of Correlated Sources for Timely Inference
AoI-based Scheduling of Correlated Sources for Timely Inference Open
We investigate a real-time remote inference system where multiple correlated sources transmit observations over a communication channel to a receiver. The receiver utilizes these observations to infer multiple time-varying targets. Due to …
View article: Communication-Efficient Cooperative Localization: A Graph Neural Network Approach
Communication-Efficient Cooperative Localization: A Graph Neural Network Approach Open
Cooperative localization leverages noisy inter-node distance measurements and exchanged wireless messages to estimate node positions in a wireless network. In communication-constrained environments, however, transmitting large messages bec…
View article: Timely Trajectory Reconstruction in Finite Buffer Remote Tracking Systems
Timely Trajectory Reconstruction in Finite Buffer Remote Tracking Systems Open
Remote tracking systems play a critical role in applications such as IoT, monitoring, surveillance and healthcare. In such systems, maintaining both real-time state awareness (for online decision making) and accurate reconstruction of hist…
View article: Optimizing Age of Information in Networks with Large and Small Updates
Optimizing Age of Information in Networks with Large and Small Updates Open
Modern sensing and monitoring applications typically consist of sources transmitting updates of different sizes, ranging from a few bytes (position, temperature, etc.) to multiple megabytes (images, video frames, LIDAR point scans, etc.). …
View article: Monitoring Correlated Sources: AoI-based Scheduling is Nearly Optimal
Monitoring Correlated Sources: AoI-based Scheduling is Nearly Optimal Open
We study the design of scheduling policies to minimize monitoring error for a collection of correlated sources, where only one source can be observed at any given time. We model correlated sources as a discrete-time Wiener process, where t…
View article: Fresh-CSMA: A distributed protocol for minimizing age of information
Fresh-CSMA: A distributed protocol for minimizing age of information Open
We consider the design of distributed scheduling algorithms that minimize age of information (AoI) in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to desi…
View article: WiSwarm: Age-of-Information-based Wireless Networking for Collaborative Teams of UAVs
WiSwarm: Age-of-Information-based Wireless Networking for Collaborative Teams of UAVs Open
The Age-of-Information (AoI) metric has been widely studied in the theoretical communication networks and queuing systems literature. However, experimental evaluation of its applicability to complex real-world time-sensitive systems is lar…
View article: Fresh-CSMA: A Distributed Protocol for Minimizing Age of Information
Fresh-CSMA: A Distributed Protocol for Minimizing Age of Information Open
We consider the design of distributed scheduling algorithms that minimize age of information in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to design a d…
View article: Optimizing age of information with correlated sources
Optimizing age of information with correlated sources Open
We develop a simple model for the timely monitoring of correlated sources over a wireless network. Using this model, we study how to optimize weighted-sum average Age of Information (AoI) in the presence of correlation. First, we discuss h…
View article: Optimizing Age of Information with Correlated Sources
Optimizing Age of Information with Correlated Sources Open
We develop a simple model for the timely monitoring of correlated sources over a wireless network. Using this model, we study how to optimize weighted-sum average Age of Information (AoI) in the presence of correlation. First, we discuss h…
View article: Information Freshness in Multi-Hop Wireless Networks
Information Freshness in Multi-Hop Wireless Networks Open
We consider the problem of minimizing age of information in multihop wireless networks and propose three classes of policies to solve the problem - stationary randomized, age difference, and age debt. For the unicast setting with fixed rou…
View article: Computation and Communication Co-Design for Real-Time Monitoring and Control in Multi-Agent Systems
Computation and Communication Co-Design for Real-Time Monitoring and Control in Multi-Agent Systems Open
We investigate the problem of co-designing computation and communication in a multi-agent system (e.g. a sensor network or a multi-robot team). We consider the realistic setting where each agent acquires sensor data and is capable of local…
View article: An Online Learning Approach to Optimizing Time-Varying Costs of AoI
An Online Learning Approach to Optimizing Time-Varying Costs of AoI Open
We consider systems that require timely monitoring of sources over a communication network, where the cost of delayed information is unknown, time-varying and possibly adversarial. For the single source monitoring problem, we design algori…
View article: Age Debt: A General Framework for Minimizing Age of Information
Age Debt: A General Framework for Minimizing Age of Information Open
We consider the problem of minimizing age of information in general single-hop and multihop wireless networks. First, we formulate a way to convert AoI optimization problems into equivalent network stability problems. Then, we propose a he…
View article: A Whittle Index Approach to Minimizing Functions of Age of Information
A Whittle Index Approach to Minimizing Functions of Age of Information Open
We consider a setting where multiple active sources send real-time updates over a single-hop wireless broadcast network to a monitoring station. Our goal is to design a scheduling policy that minimizes the time-average of general non-decre…
View article: Age Optimal Information Gathering and Dissemination on Graphs
Age Optimal Information Gathering and Dissemination on Graphs Open
We consider the problem of timely exchange of updates between a central station and a set of ground terminals $V$, via a mobile agent that traverses across the ground terminals along a mobility graph $G = (V, E)$. We design the trajectory …
View article: Age of Information for Discrete Time Queues
Age of Information for Discrete Time Queues Open
Age of information (AoI) is a time-evolving measure of information freshness, that tracks the time since the last received fresh update was generated. Analyzing peak and average AoI, two time average metrics of AoI, for various continuous …
View article: Age of information and mobility
Age of information and mobility Open
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.