By Topic

Probability of k-Hop Connection under Random Connection Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guoqiang Mao ; Univ. of Sydney & Nat. ICT Australia, Sydney, NSW, Australia ; Zijie Zhang ; Anderson, B.D.O.

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

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 11 )