• DocumentCode
    1094586
  • Title

    On the Probability of K-hop Connection in Wireless Sensor Networks

  • Author

    Ta, Xiaoyuan ; Mao, Guoqiang ; Anderson, Brian D O

  • Author_Institution
    Univ. of Sydney & Nat. ICT, Sydney
  • Volume
    11
  • Issue
    8
  • fYear
    2007
  • fDate
    8/1/2007 12:00:00 AM
  • Firstpage
    662
  • Lastpage
    664
  • Abstract
    Considering a wireless sensor network whose sensors are randomly and independently distributed in a bounded area according to a homogeneous Poisson process with intensity p 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.
  • Keywords
    probability; stochastic processes; wireless sensor networks; homogeneous Poisson process; k-hop connection; probability; recursive analytical equation; wireless sensor network; Analytical models; Australia; Computational modeling; Data communication; Delay estimation; Energy consumption; Euclidean distance; Length measurement; Poisson equations; Wireless sensor networks;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2007.070569
  • Filename
    4289995