From euclidian to hop distance in multi-hop radio networks: a discrete approach - Centre of Innovation in Telecommunications and Integration of services Accéder directement au contenu
Rapport Année : 2005

From euclidian to hop distance in multi-hop radio networks: a discrete approach

Anthony Busson
Guillaume Chelius
  • Fonction : Auteur
Eric Fleury
  • Fonction : Auteur

Résumé

In this article, we formalize the relation $\mathbbP(N_d=n)$ between the hop distance and the euclidian distance in 1-dimensional and 2-dimensional discrete networks. We provide closed formulas for the mean hop distance between two arbitrary nodes depending on their euclidian distance in both discrete and continuous networks. More generally, we also formally prove that results computed in discrete networks induce boundaries in continuous ones. Moreover, as the step of the discrete network is decreased, discrete results converge towards continuous ones. This phenomena justifies the methodology consisting in considering discrete networks to study properties that are hardly tractable in continuous networks.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-5505.pdf (658.38 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00070502 , version 1 (19-05-2006)

Identifiants

  • HAL Id : inria-00070502 , version 1

Citer

Anthony Busson, Guillaume Chelius, Eric Fleury. From euclidian to hop distance in multi-hop radio networks: a discrete approach. RR-5505, INRIA. 2005, pp.29. ⟨inria-00070502⟩
90 Consultations
50 Téléchargements

Partager

Gmail Facebook X LinkedIn More