BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/663
DTSTAMP:20230914T125933Z
SUMMARY:Graph Matchings and Wireless Communication
DESCRIPTION:Speaker: Rahul Vaze\n\nAbstract: \nAbstract: A classical proble
 m in mobile telephony is to decide user-basestation association\, i.e.\, g
 iven large number of mobile users\, which basestation should each mobile u
 ser connect to. The question is interesting because all mobile users conne
 cted to one basestation have to time-share its resources\, and the nearest
  basestation is not always the best choice because of wireless propagation
  medium.\n\nA more modern paradigm envisaged in 5G network is that active 
 mobiles are going to seek help (via relaying) from nearby idling mobile de
 vices for improving their data rates. Once again\, which neighbor should b
 e selected for relaying and what incentives to offer him to prevent him fr
 om 'gaming' the system are objects of current interest.\n\nWe will discuss
  both these problems via classical matching algorithms from graph theory.\
 n
URL:https://www.tcs.tifr.res.in/web/events/663
DTSTART;TZID=Asia/Kolkata:20160311T160000
DTEND;TZID=Asia/Kolkata:20160311T170000
LOCATION:AG-66 (Lecture Theatre)
END:VEVENT
END:VCALENDAR