On the probability of K-hop connection in wireless sensor networks

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

doi:10.1109/LCOMM.2007.070569

On the probability of K-hop connection in wireless sensor networks

Xiaoyuan Ta^*, Guoqiang Mao, Brian D.O. Anderson

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

41 Citations (Scopus)

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 ρ and each sensor has a uniform transmission radius of r_o, 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.

Original language	English
Pages (from-to)	662-664
Number of pages	3
Journal	IEEE Communications Letters
Volume	11
Issue number	8
DOIs	https://doi.org/10.1109/LCOMM.2007.070569
Publication status	Published - Aug 2007

Access to Document

10.1109/LCOMM.2007.070569

Cite this

@article{62b41e4446144570a28081b170d5d7d2,

title = "On the probability of K-hop connection in wireless sensor networks",

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 ρ 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 = "K-hop connection, Probability, Wireless sensor networks",

author = "Xiaoyuan Ta and Guoqiang Mao and Anderson, {Brian D.O.}",

year = "2007",

month = aug,

doi = "10.1109/LCOMM.2007.070569",

language = "English",

volume = "11",

pages = "662--664",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - On the probability of K-hop connection in wireless sensor networks

AU - Ta, Xiaoyuan

AU - Mao, Guoqiang

AU - Anderson, Brian D.O.

PY - 2007/8

Y1 - 2007/8

N2 - 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.

AB - 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.

KW - K-hop connection

KW - Probability

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=34548307213&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2007.070569

DO - 10.1109/LCOMM.2007.070569

M3 - Article

SN - 1089-7798

VL - 11

SP - 662

EP - 664

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 8

ER -

On the probability of K-hop connection in wireless sensor networks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this