A Hexagon-Based Key Distribution Scheme for Wireless Sensor Networks

In order to improve the secure connectivity expansibility and decrease memory costs,an efficient hexagon-based grouping key pre-distribution scheme is put forward by using secret binding.In this scheme,the polynomial-based key pre-distribution scheme is used to generate pair-wise keys for the neighboring nodes in one group,and the binding secret generated by a HMAC is employed to establish the common key for the neighboring nodes in different groups.Furthermore,the process of establishing pair-wise key is limited in the beginning of the network deployment,and the pair-wise key establishment in the process of the network updating needs to be verified by the base-station.In addition,by analyzing the relations among the radius of the cell,secure connectivity,memory costs and other parameters,the most appropriate value of the cell's radius is found,which can optimize the hexagon-based key pre-distribution scheme.