On the maximum throughput of a single chain wireless multi-hop path

Mao, G; Xiong, L; Ta, X

On the maximum throughput of a single chain wireless multi-hop path

Mao, G

Xiong, L Ta, X

Permalink

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

Closed Access

	Filename	Description	Size
	2013001380OK.pdf		1.11 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	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Xiong, L	en_US
dc.contributor.author	Ta, X	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. 398 - 402	en_US
dc.identifier.isbn	9781424423736	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29970
dc.description.abstract	In this paper, the maximum achievable throughput of a single chain wireless multi-hop path is investigated analytically. First, we prove that in an error free radio environment, a wireless multi-hop path (the number of hops k ≥ 3), in which all nodes are optimally placed and all links have an identical normalized capacity of 1, has a maximum achievable throughput of 1/3. Moreover, we show that this maximum throughput can only be achieved when all links of the path are separated into three maximal independent sets and each set of lInks become active alternatively for the same amount of time. Second, we extend our analysis to an erroneous radio environment, and prove that the maximum throughput of the k-hop path is determined by its bottleneck consecutive three-hop segment. That is, the maximum throughput of the k-hop path is the minimum of the maximum throughputs of all its consecutive three-hop segments. The findings in this paper lay guidelines for designing optimum scheduling algorithms.	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.4685050	en_US
dc.title	On the maximum throughput of a single chain wireless multi-hop path	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:

In this paper, the maximum achievable throughput of a single chain wireless multi-hop path is investigated analytically. First, we prove that in an error free radio environment, a wireless multi-hop path (the number of hops k ≥ 3), in which all nodes are optimally placed and all links have an identical normalized capacity of 1, has a maximum achievable throughput of 1/3. Moreover, we show that this maximum throughput can only be achieved when all links of the path are separated into three maximal independent sets and each set of lInks become active alternatively for the same amount of time. Second, we extend our analysis to an erroneous radio environment, and prove that the maximum throughput of the k-hop path is determined by its bottleneck consecutive three-hop segment. That is, the maximum throughput of the k-hop path is the minimum of the maximum throughputs of all its consecutive three-hop segments. The findings in this paper lay guidelines for designing optimum scheduling algorithms.

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

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