BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:On the secure connectivity of wireless sensor networks - Ganesh\, 
 A (University of Bristol)
DTSTART:20130816T123000Z
DTEND:20130816T131500Z
UID:TALK46664@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We consider a model of a wireless sensor network in which node
 s are distributed uniformly at random over a unit square\, and can communi
 cate other nodes within a ?xed radius. This is the well-known random geome
 tric graph model. In addition\, each node is assigned a subset of cryptogr
 aphic keys chosen uniformly at random from a key pool. Two nodes can commu
 nicate only if they are within range of each other\, and possess at least 
 one common key. We establish a connectivity threshold for these random gra
 ph models. This resolves a conjecture of Osman Yagan. Joint work with Bika
 sh Dey\, Santhana Krishnan and D. Manjunath.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR