BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:On the secure connectivity of wireless sensor netw
 orks - Ganesh\, A (University of Bristol)
DTSTART;TZID=Europe/London:20130816T133000
DTEND;TZID=Europe/London:20130816T141500
UID:TALK46664AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/46664
DESCRIPTION:We consider a model of a wireless sensor network i
 n which nodes are distributed uniformly at random 
 over a unit square\, and can communicate other nod
 es within a ?xed radius. This is the well-known ra
 ndom geometric graph model. In addition\, each nod
 e is assigned a subset of cryptographic keys chose
 n uniformly at random from a key pool. Two nodes c
 an communicate only if they are within range of ea
 ch other\, and possess at least one common key. We
  establish a connectivity threshold for these rand
 om graph models. This resolves a conjecture of Osm
 an Yagan. Joint work with Bikash Dey\, Santhana Kr
 ishnan and D. Manjunath.\n\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR