Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints
From MaRDI portal
Publication:1727504
DOI10.1155/2016/4319426zbMath1417.94022OpenAlexW2502182674WikidataQ59123499 ScholiaQ59123499MaRDI QIDQ1727504
Publication date: 20 February 2019
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/4319426
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp threshold functions for random intersection graphs via a coupling method
- Connectivity of the uniform random intersection graph
- The longest edge of the random minimal spanning tree
- Zero-one law for connectivity in superposition of random key graphs on random geometric graphs
- Degree and clustering coefficient in sparse random intersection graphs
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols
- Continuum Percolation
- Coverage by randomly deployed wireless sensor networks
- Random Plane Networks
- Random Geometric Graphs
- The limit distribution of the largest nearest-neighbour link in the unit d-cube
- Component evolution in a secure wireless sensor network
- Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel
- Zero–One Laws for Connectivity in Random Key Graphs
This page was built for publication: Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints
