TY - RPRT

T1 - Connectivity analysis of one-dimensional ad-hoc networks

AU - Hansen, Martin Bøgsted

AU - Rasmussen, Jakob Gulddahl

AU - Schwefel, Hans-Peter

PY - 2008

Y1 - 2008

N2 - Applications and communication protocols in dynamic ad-hoc networks are exposed to physical limitations imposed by the connectivity relations that result from mobility. Motivated by vehicular freeway scenarios, this paper analyzes a number of important connectivity metrics for instantaneous snapshots of stochastic geographic movement patterns under the assumption of a fixed radio range for each node: (1) The node degree, corresponding to the number of single-hop neighbors of a mobile node; (2) The connectivity number, expressing the number of nodes reachable via multi-hop paths of arbitrary hop-count; (3) the connectivity distance, expressing the geographic distance that a message can be propagated in the network on multi-hop paths; (4) the connectivity hops, which corresponds to the number of hops that are necessary to reach all nodes in the connected network. The paper develops analytic expressions for the distributions and moments of these random variables for general stationary MAP processes on a one dimensional space. The numerical results compares bursty vehicular traffic with independent movement scenarios described by a Poisson process.

AB - Applications and communication protocols in dynamic ad-hoc networks are exposed to physical limitations imposed by the connectivity relations that result from mobility. Motivated by vehicular freeway scenarios, this paper analyzes a number of important connectivity metrics for instantaneous snapshots of stochastic geographic movement patterns under the assumption of a fixed radio range for each node: (1) The node degree, corresponding to the number of single-hop neighbors of a mobile node; (2) The connectivity number, expressing the number of nodes reachable via multi-hop paths of arbitrary hop-count; (3) the connectivity distance, expressing the geographic distance that a message can be propagated in the network on multi-hop paths; (4) the connectivity hops, which corresponds to the number of hops that are necessary to reach all nodes in the connected network. The paper develops analytic expressions for the distributions and moments of these random variables for general stationary MAP processes on a one dimensional space. The numerical results compares bursty vehicular traffic with independent movement scenarios described by a Poisson process.

M3 - Report

T3 - Research Report Series

BT - Connectivity analysis of one-dimensional ad-hoc networks

PB - Department of Mathematical Sciences, Aalborg University

CY - Aalborg

ER -