Component evolution in a secure wireless sensor network
From MaRDI portal
Publication:5191124
DOI10.1002/net.20256zbMath1176.90067MaRDI 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
90C35: Programming involving graphs or networks
05C80: Random graphs (graph-theoretic aspects)
90B15: Stochastic network models in operations research
90B10: Deterministic network models in operations research
Related Items
Poisson Approximation of the Number of Cliques in Random Intersection Graphs, Random subcube intersection graphs. I: Cliques and covering, \(k\)-connectivity of uniform \(s\)-intersection graphs, On the complexity of the herding attack and some related attacks on hash functions, The coupling method for inhomogeneous random intersection graphs., A note on hamiltonicity of uniform random intersection graphs, 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, Constructions of independent sets in random intersection graphs, Equivalence of a random intersection graph and G (n ,p ), On Some Combinatorial Properties of Random Intersection Graphs
Cites Work
