In this paper we present some extensions on previously published results regarding connectivity issues in one\textendashdimensional ad\textendashhoc networks. We show how an equivalent $GI|D|\infty$ queueing model may be used to address the issue, and present results on both infinite and finite networks for various node placement statistics. We then show how a $GI|G|\infty$ model may be used to study broadcast percolation problems in ad\textendashhoc networks with generic node placement and random communication range. In particular, we obtain explicit results for the case of nodes distributed according to a Poisson distribution operating in a fading environment. In case of nodes distributed according to a Poisson point process, heavy traffic theory is applied to derive the critical communication range for connectivity and the critical transmission power for broadcast percolation in dense networks.<br />
Connectivity in Ad-Hoc Networks: a Queueing Theoretical Approach
Daniele Miorandi;
2004-01-01
Abstract
In this paper we present some extensions on previously published results regarding connectivity issues in one\textendashdimensional ad\textendashhoc networks. We show how an equivalent $GI|D|\infty$ queueing model may be used to address the issue, and present results on both infinite and finite networks for various node placement statistics. We then show how a $GI|G|\infty$ model may be used to study broadcast percolation problems in ad\textendashhoc networks with generic node placement and random communication range. In particular, we obtain explicit results for the case of nodes distributed according to a Poisson distribution operating in a fading environment. In case of nodes distributed according to a Poisson point process, heavy traffic theory is applied to derive the critical communication range for connectivity and the critical transmission power for broadcast percolation in dense networks.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
