Location-Independent Key Distribution for Sensor Network Using Regular Graph

Regular graph is the type of graph whose degree of all vertices are same, and this property makes it very useful in design of key distribution algorithm. Keys in wireless sensor node need to be evenly distributed for efficient storage and good connectivity. In the past various methods have been proposed to overcome the problem of key predistribution for wireless sensor network. Among these, the balanced incomplete block design technique from the theory of combinatorics provides a meaningful enhancement in key predistribution. Also various improvements have been done over this technique for especial arrangement of sensor network. Here, we use Paley graph a class of regular graph to model our key distribution in a location-independent sensor environment, where locations of sensor nodes are assumed to be unknown prior to deployment or key distribution. Experiments were performed and presented here.