In this study, to obtain stronger connectivity, we propose and analyze a scheme extended by random key predistribution (RKP), which can work only in highly dense networks and require path construction. We propose a multi-neighbor random key pre-distribution scheme that releases these strong constraints. Accordingly, an establishment protocol and a probabilistic analysis in terms of dependency overhead are presented. We have made use of the measure of dependence to derive the exact value of the key connectivity probability.