Minimum Node Degree and kappa-connectivity for Key Predistribution Schemes and Distributed Sensor Networks

摘要

Connectivity is a desired property for distributed sensor networks (DSNs) secured by key predistribution schemes (KPSs). Previous research has studied whether a DSN is connected using the random graph model, but there has been no research on how strong the connectivity is. In this paper, we give results on the minimum node degree and kappa-connectivity for DSNs secured by random KPSs and deterministic KPSs. As well, we use computer simulations to verify our results and validate the use of the random graph model in computing the connectivity of DSNs.