Analysis on Node´s Pairwise Key Path Construction in Sensor Networks

Key pre-distribution schemes based on regular network such as hypercube have several advantages. Examples are lower storage cost and ability to find a proper key path more quickly. However, the probability to establish direct keys is fairly low. Based on available weak connectivity of hypercube, the framework of local leveled connectivity model is presented in key-sharing graph, and also node´s localized searching algorithm is proposed. Experiments show that presented schemes do improve node´s average degree in pairwise key-sharing graph.