Probability of k-Hop Connection under Random Connection Model

作者:Mao Guoqiang*; Zhang Zijie; Anderson Brian D O
来源:IEEE Communications Letters, 2010, 14(11): 1023-1025.
DOI:10.1109/LCOMM.2010.092310.101298

摘要

Consider a wireless sensor network with i.i.d. sensors following a homogeneous Poisson distribution in a given area.. in R-2. A sensor located at x(2) is an element of A is directly connected to a sensor located at x(1) is an element of A with probability g (x(2) - x(1)), independent of any other distinct pair of sensors. In this letter, we provide a recursive formula for computing Pr (k vertical bar x), the probability that a node x is an element of A apart from another node is connected to that node at exactly k hops, for a generic random connection function g : R-2 -> [0, 1]. The recursive formula is accurate for k = 1, 2 and provides an approximation for Pr (k vertical bar x) for k > 2. The exact and approximate analytical results are validated by simulations. The knowledge of Pr Pr (k vertical bar x) can be used in a number of areas in sensor networks.

  • 出版日期2010-11