a deterministic multiple key space scheme for wireless sensor networks via combinatorial designs

The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. to do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (mkss). in the mkss, the authors define two random parameters to make better resilience than existing schemes. instead of a random selection of these parameters, our proposal provides a combinatorial framework by substituting appropriate parameters to satisfy certain properties. we show that the proposed scheme enhances storage memory and improves performance or security by carefully choosing a combinatorial design. in addition, we propose a new key agreement mechanism by using derivative operation on univariate polynomials to aim a desired computational overhead. in this case, the computational overhead of our approach lower than the general case of the mkss’s. if we choose the primitive element in our general formula as the special case of the mkss, this new process has the same computational overhead as the mkss.