BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20190310T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181104T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20190130T131908Z
UID:014305C5-51C5-4E79-AB8A-E91631B66AD6
DTSTART;TZID=America/New_York:20181219T100000
DTEND;TZID=America/New_York:20181219T110000
DESCRIPTION:Age-based Scheduling: Improving Data Freshness for Wireless Rea
 l-Time Traffic\n\nAbstract: We consider the problem of scheduling real-tim
 e traffic with hard deadlines in a wireless ad hoc network. In contrast to
  existing real-time scheduling policies that merely ensure a minimal timel
 y throughput\, our design goal is to provide guarantees on both the timely
  throughput and data freshness in terms of age-of-information (AoI)\, whic
 h is a newly proposed metric that captures the “age” of the most recen
 tly received information at the destination of a link. The main idea is to
  introduce the AoI as one of the driving factors in making scheduling deci
 sions. We first prove that the proposed scheduling policy is feasibility-o
 ptimal\, i.e.\, satisfying the per-traffic timely throughput requirement. 
 Then\, we derive an upper bound on a considered data freshness metric in t
 erms of AoI\, demonstrating that the network-wide data freshness is guaran
 teed and can be tuned under the proposed scheduling policy. Interestingly\
 , we reveal that the improvement of network data freshness is at the cost 
 of slowing down the convergence of the timely throughput. Extensive simula
 tions are performed to validate our analytical results. Both analytical an
 d simulation results confirm the capability of the proposed scheduling pol
 icy to improve the data freshness without sacrificing the feasibility opti
 mality.\n\nSpeaker(s): Ning Lu\, \n\nRoom: 4152\, Bldg: EIT\, 200 Univ. Av
 e. West\, Waterloo\, Ontario\, Canada\, N2L 3G1
LOCATION:Room: 4152\, Bldg: EIT\, 200 Univ. Ave. West\, Waterloo\, Ontario\
 , Canada\, N2L 3G1
ORGANIZER:wzhuang@uwaterloo.ca
SEQUENCE:1
SUMMARY:Vehicular Technology Chapter Technical Seminar
URL;VALUE=URI:https://events.vtools.ieee.org/m/189816
X-ALT-DESC:Description: <br /><p><strong>Age-based Scheduling: Improving Da
 ta Freshness for Wireless Real-Time Traffic</strong></p>\n<p><strong>Abstr
 act: </strong>We consider the problem of scheduling real-time traffic with
  hard deadlines in a wireless ad hoc network. In contrast to existing real
 -time scheduling policies that merely ensure a minimal timely throughput\,
  our design goal is to provide guarantees on both the timely throughput an
 d data freshness in terms of age-of-information (AoI)\, which is a newly p
 roposed metric that captures the &ldquo\;age&rdquo\; of the most recently 
 received information at the destination of a link. The main idea is to int
 roduce the AoI as one of the driving factors in making scheduling decision
 s. We first prove that the proposed scheduling policy is feasibility-optim
 al\, i.e.\, satisfying the per-traffic timely throughput requirement. Then
 \, we derive an upper bound on a considered data freshness metric in terms
  of AoI\, demonstrating that the network-wide data freshness is guaranteed
  and can be tuned under the proposed scheduling policy. Interestingly\, we
  reveal that the improvement of network data freshness is at the cost of s
 lowing down the convergence of the timely throughput. Extensive simulation
 s are performed to validate our analytical results. Both analytical and si
 mulation results confirm the capability of the proposed scheduling policy 
 to improve the data freshness without sacrificing the feasibility optimali
 ty.</p>
END:VEVENT
END:VCALENDAR