Analytical bounds on the critical density for percolation in wireless multi-hop networks

Ng, SC; Mao, G; Anderson, BDO

Analytical bounds on the critical density for percolation in wireless multi-hop networks

Ng, SC Mao, G

Anderson, BDO

Permalink

Publication Type:: Conference Proceeding
Citation:: GLOBECOM - IEEE Global Telecommunications Conference, 2011
Issue Date:: 2011-12-01

Closed Access

	Filename	Description	Size
	2013001569OK.pdf		271.62 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	Ng, SC	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	2011-12-01	en_US
dc.identifier.citation	GLOBECOM - IEEE Global Telecommunications Conference, 2011	en_US
dc.identifier.isbn	9781424492688	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29478
dc.description.abstract	In this paper we develop analytical bounds on the critical density for percolation in wireless multi- hop networks, but in contrast to other studies, under a random connection model and with nodes Poissonly distributed in the plane ℝ 2. The establishment of a direct connection between any two nodes follows a random connection model satisfying some intuitively reasonable conditions, i.e. rotational and translational invariance, non- increasing monotonicity and integral boundedness. It is well known that under the above network model and connection model there exists a critical density below which almost surely a fixed but arbitrary node is connected (via single or multi-hop path) to finite number of other nodes only, and above which the node is connected to an infinite number of other nodes with a positive probability. In this paper we investigate the bounds on the critical density. The result is compared with the existing results under a specific connection model, i.e. the unit disk communication model, and it is shown that our method generates bounds close to the known ones. The result provides valuable insight into the design of large- scale wireless multi-hop networks. © 2011 IEEE.	en_US
dc.relation.ispartof	GLOBECOM - IEEE Global Telecommunications Conference	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2011.6133604	en_US
dc.title	Analytical bounds on the critical density for percolation in wireless multi-hop networks	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	en_US
dc.location.activity	Houston, TX, USA	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.publication-status	Published	en_US

Abstract:

In this paper we develop analytical bounds on the critical density for percolation in wireless multi- hop networks, but in contrast to other studies, under a random connection model and with nodes Poissonly distributed in the plane ℝ 2. The establishment of a direct connection between any two nodes follows a random connection model satisfying some intuitively reasonable conditions, i.e. rotational and translational invariance, non- increasing monotonicity and integral boundedness. It is well known that under the above network model and connection model there exists a critical density below which almost surely a fixed but arbitrary node is connected (via single or multi-hop path) to finite number of other nodes only, and above which the node is connected to an infinite number of other nodes with a positive probability. In this paper we investigate the bounds on the critical density. The result is compared with the existing results under a specific connection model, i.e. the unit disk communication model, and it is shown that our method generates bounds close to the known ones. The result provides valuable insight into the design of large- scale wireless multi-hop networks. © 2011 IEEE.

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

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