Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors’ expected locations and discovered locations to help the predistribution of the keying materials. Recent literature contains proposals for key predistribution schemes for sensor networks in which nodes are deployed in separate groups. In this paper the system consider the implications of group deployment for the connectivity and resilience of a key predistribution scheme. Key predistribution for wireless sensor networks has been a challenging field of research because stringent resource constraints make the key predistribution schemes difficult to implement. Despite this, key predistribution scheme is regarded as the best option for key management in wireless sensor networks. Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. Many existing system provide establish pairwise key for sensor networks. They had a drawback of non-scalability. In this project the system propose a novel pre-distribution scheme that the storage size of each sensor is independent of the network size. It uses a special type of multi-variate polynomial to minimize the storage requirement of sensors. Polynomial computations are very efficient, the proposed scheme is especially suitable for key establishment in WSNs.