On the probability of K-hop connection in wireless sensor networks
- Publication Type:
- Journal Article
- IEEE Communications Letters, 2007, 11 (8), pp. 662 - 664
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Considering a wireless sensor network whose sensors are randomly and independently distributed in a bounded area according to a homogeneous Poisson process with intensity ρ and each sensor has a uniform transmission radius of ro, an important problem is to obtain the probability that two random sensors separated by a known distance x are k hop neighbors for some positive integer k. In this letter, we give a recursive analytical equation for computing this probability. The analytical solution is validated by simulations. © 2007 IEEE.
Please use this identifier to cite or link to this item: