On the secure connectivity of wireless sensor networks

Add to your list(s) Download to your calendar using vCal

• Ganesh, A (University of Bristol)
• Friday 16 August 2013, 13:30-14:15
• Seminar Room 1, Newton Institute.

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:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.