Probability of k-hop connection under random connection model

Mao, G; Zhang, Z; Anderson, BDO

Probability of k-hop connection under random connection model

Mao, G

Zhang, Z Anderson, BDO

Permalink

Publication Type:: Journal Article
Citation:: IEEE Communications Letters, 2010, 14 (11), pp. 1023 - 1025
Issue Date:: 2010-11-01

Closed Access

	Filename	Description	Size
	2013001481OK.pdf		457.74 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	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Zhang, Z	en_US
dc.contributor.author	Anderson, BDO	en_US
dc.date.issued	2010-11-01	en_US
dc.identifier.citation	IEEE Communications Letters, 2010, 14 (11), pp. 1023 - 1025	en_US
dc.identifier.issn	1089-7798	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28440
dc.description.abstract	Consider a wireless sensor network with i.i.d. 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 {x}-{1} ε A with probability g(2-1), 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 → [0,1]. 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. © 2010 IEEE.	en_US
dc.relation.ispartof	IEEE Communications Letters	en_US
dc.relation.isbasedon	10.1109/LCOMM.2010.092310.101298	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Probability of k-hop connection under random connection model	en_US
dc.type	Journal Article
utslib.citation.volume	11	en_US
utslib.citation.volume	14	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	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	11	en_US
pubs.publication-status	Published	en_US
pubs.volume	14	en_US

Abstract:

Consider a wireless sensor network with i.i.d. 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 {x}-{1} ε A with probability g(2-1), 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 → [0,1]. 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. © 2010 IEEE.

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

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