Key predistribution for homogeneous wireless sensor networks with group deployment of nodes
ACM Transactions on Sensor Networks (TOSN)
Key management systems for sensor networks in the context of the Internet of Things
Computers and Electrical Engineering
Geometric graphs with randomly deleted edges - connectivity and routing protocols
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Self-stabilizing consensus average algorithm in distributed sensor networks
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.00 |
We consider a key distribution scheme for wireless sensor networks which uses deployment knowledge. Deployment is modeled as a grid of hexagonal clusters, into centers of which the sensor nodes are dropped according to a given probability distribution (e.g. a Gaussian one). We consider sensor connectivity in a random intersection graph model, instead of the more commonly used in literature G(n, p) graph model. While the latter is easier to analyze, the former is much more suitable to modeling sensor network key distribution. We provide analytical, asymptotic results showing how to pick parameters (key pool size |S|, the number of chosen keys d) depending on the number of deployed nodes in order to assure global connectivity of the network, and estimate the diameter of the network for the given parameters.