Component evolution in a secure wireless sensor network
From MaRDI portal
Recommendations
- Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks
- On secure communication in a sensor network
- Random key predistribution for wireless sensor networks using deployment knowledge
- Connectivity of the uniform random intersection graph
- Forward-Secure Key Evolution in Wireless Sensor Networks
Cites work
Cited in
(19)- Connectivity of the uniform random intersection graph
- Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints
- Phase transitions for detecting latent geometry in random graphs
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Random key predistribution for wireless sensor networks using deployment knowledge
- Perfect matchings in random intersection graphs
- Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks
- Constructions of independent sets in random intersection graphs
- Equivalence of a random intersection graph and G (n ,p )
- Random subcube intersection graphs. I: Cliques and covering
- Critical density thresholds in distributed wireless networks
- On Some Combinatorial Properties of Random Intersection Graphs
- \(k\)-connectivity of uniform \(s\)-intersection graphs
- On the complexity of the herding attack and some related attacks on hash functions
- Poisson approximation of the number of cliques in random intersection graphs
- On secure communication in a sensor network
- The coupling method for inhomogeneous random intersection graphs.
- A survey on the Intersection graphs of ideals of rings
- A note on hamiltonicity of uniform random intersection graphs
This page was built for publication: Component evolution in a secure wireless sensor network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191124)
