Thresholding random geometric graph properties motivated by ad hoc sensor networks
From MaRDI portal
Publication:988583
DOI10.1016/j.jcss.2010.01.002zbMath1210.05159MaRDI QIDQ988583
Publication date: 18 August 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2010.01.002
thresholds; connectivity; coverage; random geometric graphs; stretch; local algorithm; sensor network models
05C80: Random graphs (graph-theoretic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity