Random Geometric Graphs and the Initialization Problem for Wireless Networks
type: Dataset
contact point: Organization
  fn: CCSD
keyword: coverage
keyword: connectivity
keyword: minimummaximum-degrees
keyword: randomized-distributed-algorithms
keyword: infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc
keyword: hop-diameter
keyword: analytical-methods
keyword: infoeu-reposemanticsconferenceobject
keyword: transmittingsensing-ranges
keyword: energy-consumption
keyword: conference-papers
keyword: topology-control
keyword: infoinfo-nicomputer-science-csnetworking-and-internet-architecture-csni
keyword: fundamental-limits-of-random-radio-networks
keyword: infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm
description: 32 pages. Tutorial invité
issued: 2026-05-08T00:43:19.996117
language: en
modified: 2026-05-08T00:43:19.996122

test_moissonnage_selune
type: Agent

Random Geometric Graphs and the Initialization Problem for Wireless Networks
type: Distribution
access URL: https://hal.science/hal-00911731
format: HTML
issued: 2026-05-08T00:43:19.998780
modified: 2026-05-08T00:43:19.977300