A novel key pre-distribution scheme for sensor networks is proposed, which enables sensor nodes to communicate securely with each other using cryptographic techniques. The approach uses the rational normal curves in the projective space with the dimension n over the finite field \(
\). Both secure connectivity and resilience of the resulting sensor networks are analyzed. By choosing the parameters q and n properly, this key pre-distribution scheme has some advantages over the previous known schemes. In addition, if the number of the rational normal curves in the scheme becomes too large for an application, the size may be reduced by choosing a part of the curves randomly. This reduction has, shown by our experiments, only minimal impact on secure connectivity and resilience of the resulting sensor network.
sensor network key pre-distribution scheme combinatorial design rational normal curve projective space finite field