From euclidian to hop distance in multi-hop radio networks: a discrete approach
Abstract
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.
Domains
Other [cs.OH]
Loading...