Polynomial based key predistribution scheme in wireless mesh networks

Abstract

Wireless mesh networks (WMNs) have the ability to integrate with other networks while providing a fast and cost-saving deployment. The network security is one of important challenge problems in this kind of networks. This paper is focused on key management between mesh and sensor networks. We propose an efficient key pre-distribution scheme based on two polynomials in wireless mesh networks by employing the nature of heterogeneity. Our scheme realizes the property of bloom filters, i.e., neighbor nodes can discover their shared keys but have no knowledge on the different keys possessed by the other node, without the probability of false positive. The analysis presented in this paper shows that our scheme has the ability to establish three different security level keys and achieves the property of self adaptive security for sensor networks with acceptable computation and communication consumption