BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1150
DTSTAMP:20230914T125952Z
SUMMARY:Online Energy Minimization Under A Peak Age of Information Constrai
 nt
DESCRIPTION:Speaker: Kumar Saurav\n\nAbstract: \nWe consider a node where p
 ackets of fixed size are generated at arbitrary intervals. The node is req
 uired to maintain the peak age of information (AoI) at the monitor below a
  threshold by transmitting potentially a subset of the generated packets. 
 At any time\, depending on packet availability and current AoI\, the node 
 can choose the packet to transmit\, and its transmission speed. We conside
 r a power function (rate of energy consumption) that is increasing and con
 vex in transmission speed\, and the objective is to minimize the energy co
 nsumption under the peak AoI constraint at all times. For this problem\, w
 e propose a (customized) greedy policy\, and analyze its competitive ratio
  (CR) by comparing it against an optimal offline policy by deriving some s
 tructural results. We show that for polynomial power functions\, the CR up
 per bound for the greedy policy is independent of the system parameters\, 
 such as the peak AoI\, packet size\, time horizon\, or the number of packe
 ts generated. Also\, we derive a lower bound on the competitive ratio of a
 ny causal policy\, and show that for exponential power functions (e.g.\, S
 hannon rate function)\, the competitive ratio of any causal policy grows e
 xponentially with increase in the ratio of packet size to peak AoI.\n\nThi
 s talk is based on the joint work with Prof. Rahul Vaze\, set to appear in
  the Proc. WiOpt 2021.\n\nZoom link: https://zoom.us/j/93889521556?pwd=eEF
 JWVRtRHNpNlpZWmhNYTJGQTF6Zz09\n
URL:https://www.tcs.tifr.res.in/web/events/1150
DTSTART;TZID=Asia/Kolkata:20210813T171500
DTEND;TZID=Asia/Kolkata:20210813T181500
END:VEVENT
END:VCALENDAR