Combinatorics and Wireless Sensor Networks
Lead Research Organisation:
Royal Holloway University of London
Department Name: Mathematics
Abstract
Wireless sensor networks are collections of low power devices which can communicate wirelessly, produce data (from an onboard sensor, say) and engage in limited computation. Such networks of devices have many applications, for example: to wildlife monitoring, disaster recovery, warehouse security and military situations.This proposal aims to develop the mathematics associated with securing wireless sensor networks. In particular, we will study the mathematics of distributing secret keying material amongst the nodes in a network ('key pre-distribution') in order to more accurately model well known schemes and in order to provide improvements on these schemes. We will also investigate ways of managing keys post-deployment, to prevent the security of the network being compromised by the loss of nodes or by the capture of nodes and the discovery of the keying material they posess.
People |
ORCID iD |
Simon Blackburn (Principal Investigator) | |
K Martin (Co-Investigator) |
Publications
Blackburn S
(2009)
Connectivity of the uniform random intersection graph
in Discrete Mathematics
Blackburn S
(2010)
Two-Dimensional Patterns With Distinct Differences-Constructions, Bounds, and Maximal Anticodes
in IEEE Transactions on Information Theory
Blackburn S
(2010)
Traceability codes
in Journal of Combinatorial Theory, Series A
Blackburn S
(2010)
Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
in IEEE Transactions on Information Theory
Etzion T
(2009)
Properties of the Error Linear Complexity Spectrum
in IEEE Transactions on Information Theory