2014 Tenth International Conference on Computational Intelligence and Security (CIS) (2014)
Kunming, Yunnan, China
Nov. 15, 2014 to Nov. 16, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIS.2014.139
Key management for wireless sensor networks has been a challenging research topic since stringent resource constraints make the key pre-distribution schemes difficult to implement. This paper proposes a novel key pre-distribution method based on trivariate symmetry polynomial and hash function. First, the base station assigns some random numbers to each node using BIBD, then two nodes calculate the initial pairwise key using trivariate polynomial which is rotation symmetry. Afterwards each node performs hash operation on the pairwise key depending on the node identifier. In this way, any pair of nodes can obtain the session key. The proposed scheme can guarantee that every pair of nodes intersects on at least one common random number to establish the pairwise key using BIBD. This scheme greatly increases the network connectivity with acceptable computational overhead since only polynomial arithmetic is involved.
Polynomials, Wireless sensor networks, Security, Base stations, Computers, Ad hoc networks, Computational intelligence
Z. Qin, Y. Wang, H. Wang and J. Huang, "A Novel Key Pre-distribution Scheme in Wireless Sensor Networks," 2014 Tenth International Conference on Computational Intelligence and Security (CIS), Kunming, Yunnan, China, 2014, pp. 615-619.