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

Ta, X; Mao, G; Anderson, BDO

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

Ta, X Mao, G

Anderson, BDO

Permalink

Publication Type:: Journal Article
Citation:: IEEE Communications Letters, 2007, 11 (8), pp. 662 - 664
Issue Date:: 2007-08-01

Closed Access

	Filename	Description	Size
	2013001376OK.pdf		113.31 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Ta, X	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Anderson, BDO	en_US
dc.date.issued	2007-08-01	en_US
dc.identifier.citation	IEEE Communications Letters, 2007, 11 (8), pp. 662 - 664	en_US
dc.identifier.issn	1089-7798	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28437
dc.description.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. © 2007 IEEE.	en_US
dc.relation.ispartof	IEEE Communications Letters	en_US
dc.relation.isbasedon	10.1109/LCOMM.2007.070569	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	On the probability of K-hop connection in wireless sensor networks	en_US
dc.type	Journal Article
utslib.citation.volume	8	en_US
utslib.citation.volume	11	en_US
utslib.for	1005 Communications Technologies	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access
pubs.issue	8	en_US
pubs.publication-status	Published	en_US
pubs.volume	11	en_US

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. © 2007 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/28437