Critical density thresholds in distributed wireless networks
From MaRDI portal
Publication:3448755
Recommendations
- scientific article; zbMATH DE number 1254188
- On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension
- One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
- Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks
- Component evolution in a secure wireless sensor network
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1254188 (Why is no real title available?)
- Continuum Percolation
- Critical Behavior in the Satisfiability of Random Boolean Expressions
Cited in
(7)- Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks
- Thresholding random geometric graph properties motivated by ad hoc sensor networks
- On Radio Broadcasting in Random Geometric Graphs
- Fast message dissemination in random geometric networks
- Density: A Context Parameter of Ad Hoc Networks
- Plane and planarity thresholds for random geometric graphs
- One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
This page was built for publication: Critical density thresholds in distributed wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448755)