University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > On the secure connectivity of wireless sensor networks

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

On the secure connectivity of wireless sensor networks

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Stochastic Processes in Communication Sciences

We consider a model of a wireless sensor network in which nodes are distributed uniformly at random over a unit square, and can communicate other nodes within a ?xed radius. This is the well-known random geometric graph model. In addition, each node is assigned a subset of cryptographic keys chosen uniformly at random from a key pool. Two nodes can communicate only if they are within range of each other, and possess at least one common key. We establish a connectivity threshold for these random graph models. This resolves a conjecture of Osman Yagan. Joint work with Bikash Dey, Santhana Krishnan and D. Manjunath.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

AV Suite, Room 211, 2nd floor, Alison Richard Building, 7 West Road, Cambridge The Fitzwilliam Museum/Gonville & Caius, Stephen Hawking Building Lady Mitchell Hall, Sidgwick Site Sidgwick Avenue, CB3 9DA

Other talks

How Much Does Homology Really Know? title abstract tbc CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body Scattering Plenty: the people who made the modern countryside The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Group Work
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity