Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jayanth S

dblp:341/5642 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 56% Edge and fog computing · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
age of information
1.012026
Beyond Age of Information: Joint Optimization of Sampling, Processing, and Actuation Accuracy in Goal-Oriented Communication · INFOCOM 2026
Edge and fog computing
task-oriented communication
1.012026
Beyond Age of Information: Joint Optimization of Sampling, Processing, and Actuation Accuracy in Goal-Oriented Communication · INFOCOM 2026
Internet of things and sensor networks › cyber-physical systems
networked control
0.312026
Beyond Age of Information: Joint Optimization of Sampling, Processing, and Actuation Accuracy in Goal-Oriented Communication · INFOCOM 2026

Methods — techniques the papers use, named apart from their topics

joint optimization · 1.0
YearPublicationVenuePosition
2026 Beyond Age of Information: Joint Optimization of Sampling, Processing, and Actuation Accuracy in Goal-Oriented Communication
Rishabh Sharad Pomaje, Jayanth S, Rajshekhar Vishweshwar Bhat, Nikolaos Pappas 0001
INFOCOM2
2023 Distortion Minimization with Age of Information and Cost Constraints
abstract
We consider a source node deployed in a real-time monitoring application that needs to sample a stochastic process and convey its state timely and accurately to a destination over a wireless ON/OFF channel. The source can either process a raw sample to determine its current state and transmit that information or transmit the raw sample and let the destination determine the state. The source is subjected to an average cost constraint, and it cannot sample, process, and transmit at all the time instants due to the associated costs. When the destination does not receive information, it uses the previous information as an estimate of the current state, which, if it matches the actual state at the source, the distortion is considered to be zero. The objective is to minimize average expected distortion subject to constraints on the average expected age of information (AoI) of states of interest and costs incurred by the source, where the AoI of a state increases if no status update is received, else drops to unity. We derive a stationary randomized policy (SRP) to solve the formulated problem, for which we obtain the expression for the expected AoI under the SRP using a lumpability argument on the two-dimensional discrete-time Markov chain formed using AoI and instantaneous distortion as states. We extensively study the impact of the system parameters on the average distortion under the SRP and draw significant conclusions.
Jayanth S, Nikolaos Pappas 0001, Rajshekhar Vishweshwar Bhat
WiOpt1