On the connectivity properties of wireless multi-hop networks

Ta, X; Mao, G; Anderson, BDO

On the connectivity properties of wireless multi-hop networks

Ta, X Mao, G

Anderson, BDO

Permalink

Publication Type:: Conference Proceeding
Citation:: 3rd International Conference on Communications and Networking in China, ChinaCom 2008, 2008, pp. 958 - 962
Issue Date:: 2008-12-01

Closed Access

	Filename	Description	Size
	2013001378OK.pdf		1.88 MB	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	2008-12-01	en_US
dc.identifier.citation	3rd International Conference on Communications and Networking in China, ChinaCom 2008, 2008, pp. 958 - 962	en_US
dc.identifier.isbn	9781424423736	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29969
dc.description.abstract	Given a multi-hop network in which a total of n nodes are randomly and independently distributed in a unit square following a uniform distribution and each node has a uniform transmission range r(n), and two distinct nodes can directly communicate with each other if and only if their Euclidean distance is at most r(n), this paper investigates the characteristics of the minimum transmission range rc(n), at which the network is connected with a high probability. We show that for small values of n, rc2(n) grows approximately linearly with 1/n; and as n goes to infinity, rc2(n) scales with log n/n. Simulations are performed to verify the theoretical analysis. The results of this paper are very useful in the design and dimensioning of wireless sensor networks and wireless ad hoc networks.	en_US
dc.relation.ispartof	3rd International Conference on Communications and Networking in China, ChinaCom 2008	en_US
dc.relation.isbasedon	10.1109/CHINACOM.2008.4685183	en_US
dc.title	On the connectivity properties of wireless multi-hop networks	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	en_US
dc.location.activity	Hangzhou	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:

Given a multi-hop network in which a total of n nodes are randomly and independently distributed in a unit square following a uniform distribution and each node has a uniform transmission range r(n), and two distinct nodes can directly communicate with each other if and only if their Euclidean distance is at most r(n), this paper investigates the characteristics of the minimum transmission range rc(n), at which the network is connected with a high probability. We show that for small values of n, rc2(n) grows approximately linearly with 1/n; and as n goes to infinity, rc2(n) scales with log n/n. Simulations are performed to verify the theoretical analysis. The results of this paper are very useful in the design and dimensioning of wireless sensor networks and wireless ad hoc networks.

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

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