Connectivity for line-of-sight networks in higher dimensions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

Connectivity for line-of-sight networks in higher dimensions

Abstract

Let T be a d-dimensional toroidal grid of n^d points. For a given range parameter ω, and a positive integer k ≤q d, we say that two points in T are mutually visible if they differ in at most k coordinates and are a distance at most ω apart, where distance is measured using the \ellₚ norm. We obtain a random d-dimensional line-of-sight graph G by placing a node at each point in T independently with some fixed probability p^* and connecting all pairs of mutually visible nodes. We prove an asymptotically tight connectivity result for this random graph.
Fichier principal
Vignette du fichier
1784-7886-1-PB.pdf (180.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00980756 , version 1 (18-04-2014)

Identifiers

Cite

Luc Devroye, Linda Farczadi. Connectivity for line-of-sight networks in higher dimensions. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 2 (2), pp.71--86. ⟨10.46298/dmtcs.610⟩. ⟨hal-00980756⟩

Collections

TDS-MACS
88 View
910 Download

Altmetric

Share

Gmail Facebook X LinkedIn More