Component evolution in a secure wireless sensor network
From MaRDI portal
Publication:5191124
DOI10.1002/net.20256zbMath1176.90067OpenAlexW4231918995MaRDI QIDQ5191124
Jerzy Jaworski, Katarzyna Rybarczyk, Mindaugas Bloznelis
Publication date: 28 July 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20256
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)
Related Items (16)
Random subcube intersection graphs. I: Cliques and covering ⋮ Constructions of independent sets in random intersection graphs ⋮ On Some Combinatorial Properties of Random Intersection Graphs ⋮ Random key predistribution for wireless sensor networks using deployment knowledge ⋮ \(k\)-connectivity of uniform \(s\)-intersection graphs ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Perfect matchings in random intersection graphs ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ A note on hamiltonicity of uniform random intersection graphs ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ A survey on the Intersection graphs of ideals of rings ⋮ The coupling method for inhomogeneous random intersection graphs. ⋮ Poisson Approximation of the Number of Cliques in Random Intersection Graphs ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ Equivalence of a random intersection graph and G (n ,p ) ⋮ Connectivity of the uniform random intersection graph
Cites Work
This page was built for publication: Component evolution in a secure wireless sensor network
