Critical density thresholds in distributed wireless networks

DOI10.1007/978-1-4757-3789-9_14zbMATH Open1377.94005OpenAlexW1595613081MaRDI QIDQ3448755FDOQ3448755

Authors: Bhaskar Krishnamachari, Stephen B. Wicker, Ramon Bejar, Marc Pearlman 

Publication date: 27 October 2015

Published in: Communications, Information and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4757-3789-9_14

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

Mathematics Subject Classification ID

Communication theory (94A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Continuum Percolation
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Title not available (Why is that?)
• Title not available (Why is that?)

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)