Pages that link to "Item:Q1413688"
From MaRDI portal
The following pages link to Covering algorithms, continuum percolation and the geometry of wireless networks (Q1413688):
Displaying 12 items.
- Maximizing system lifetime in wireless sensor networks (Q872283) (← links)
- Continuum percolation with unreliable and spread-out connections (Q1777943) (← links)
- Mobile geometric graphs: detection, coverage and percolation (Q1955843) (← links)
- Designing a contact process: the piecewise-homogeneous process on a finite set with applications (Q2485821) (← links)
- Monotone properties of random geometric graphs have sharp thresholds (Q2496499) (← links)
- Connectivity in finite ad-hoc networks (Q2519295) (← links)
- The spectrum of a random geometric graph is concentrated (Q2641416) (← links)
- On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications (Q2749123) (← links)
- Bounded-hop percolation and wireless communication (Q2836234) (← links)
- Sentry Selection in Wireless Networks (Q3566390) (← links)
- Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem (Q4564093) (← links)
- (Q5365052) (← links)