On the giant component in wireless multi-hop networks

Ta, X; Mao, G; Anderson, BDO

On the giant component in wireless multi-hop networks

Ta, X Mao, G

Anderson, BDO

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Wireless Communications and Networking Conference, WCNC, 2009
Issue Date:: 2009-09-22

Closed Access

	Filename	Description	Size
	2013001381OK.pdf		323.29 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	2009-09-22	en_US
dc.identifier.citation	IEEE Wireless Communications and Networking Conference, WCNC, 2009	en_US
dc.identifier.isbn	9781424429486	en_US
dc.identifier.issn	1525-3511	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29473
dc.description.abstract	In this paper, we study the giant component, the largest component containing a non-vanishing fraction of nodes, in a wireless multi-hop network where n nodes are randomly and uniformly distributed in [0, 1] d (d = 1, 2) and any two nodes can communicate directly with each other iff their Euclidean distance is not larger than the transmission range r. We investigate the probability that the size of the giant component is at least a given threshold p with 0.5 < p ≤ 1. For d = 1, we derive a closed-form analytical formula for this probability. For d = 2, we propose an empirical formula for this probability using simulations. In addition, we compare the transmission range required for having a connected network with the transmission range required for having a certain size giant component for d = 2. The comparison shows that a significant energy saving can be achieved if we only require most nodes (e.g. 95%) to be connected to the giant component rather than require all nodes to be connected. The results of this paper are of practical value in the design and analysis of wireless ad hoc networks and sensor networks. © 2009 IEEE.	en_US
dc.relation.ispartof	IEEE Wireless Communications and Networking Conference, WCNC	en_US
dc.relation.isbasedon	10.1109/WCNC.2009.4917855	en_US
dc.title	On the giant component in wireless multi-hop networks	en_US
dc.type	Conference Proceeding
utslib.for	1006 Computer Hardware	en_US
dc.location.activity	Budapest	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 study the giant component, the largest component containing a non-vanishing fraction of nodes, in a wireless multi-hop network where n nodes are randomly and uniformly distributed in [0, 1] d (d = 1, 2) and any two nodes can communicate directly with each other iff their Euclidean distance is not larger than the transmission range r. We investigate the probability that the size of the giant component is at least a given threshold p with 0.5 < p ≤ 1. For d = 1, we derive a closed-form analytical formula for this probability. For d = 2, we propose an empirical formula for this probability using simulations. In addition, we compare the transmission range required for having a connected network with the transmission range required for having a certain size giant component for d = 2. The comparison shows that a significant energy saving can be achieved if we only require most nodes (e.g. 95%) to be connected to the giant component rather than require all nodes to be connected. The results of this paper are of practical value in the design and analysis of wireless ad hoc networks and sensor networks. © 2009 IEEE.

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

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