Capacity of interference-limited three dimensional CSMA networks

Yang, T; Mao, G; Zhang, W

Capacity of interference-limited three dimensional CSMA networks

Yang, T Mao, G

Zhang, W

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Conference on Communications, 2012, pp. 5010 - 5014
Issue Date:: 2012-12-01

Closed Access

	Filename	Description	Size
	2013001367OK.pdf		1.13 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	Yang, T	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Zhang, W	en_US
dc.date.issued	2012-12-01	en_US
dc.identifier.citation	IEEE International Conference on Communications, 2012, pp. 5010 - 5014	en_US
dc.identifier.isbn	9781457720529	en_US
dc.identifier.issn	1550-3607	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29994
dc.description.abstract	In this paper, we study the throughput of interference-limited three dimensional (3D) CSMA networks. Specifically, we consider a network with a total of n nodes uniformly i.i.d. in a cube of edge length n1/3. Further, CSMA random access scheme is employed and the SINR model is used to simulate a successful transmission. We first give a sufficient condition on the transmit power required for the CSMA network to be asymptotically almost surely (a.a.s.) connected as n → ∞ under the SINR model. Then, we demonstrate constructively that a throughput of Θ(1/(n log2 n) 1/3) is obtainable by each node for an arbitrarily chosen destination. © 2012 IEEE.	en_US
dc.relation.ispartof	IEEE International Conference on Communications	en_US
dc.relation.isbasedon	10.1109/ICC.2012.6364131	en_US
dc.title	Capacity of interference-limited three dimensional CSMA networks	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	Ottawa, ON	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 throughput of interference-limited three dimensional (3D) CSMA networks. Specifically, we consider a network with a total of n nodes uniformly i.i.d. in a cube of edge length n1/3. Further, CSMA random access scheme is employed and the SINR model is used to simulate a successful transmission. We first give a sufficient condition on the transmit power required for the CSMA network to be asymptotically almost surely (a.a.s.) connected as n → ∞ under the SINR model. Then, we demonstrate constructively that a throughput of Θ(1/(n log2 n) 1/3) is obtainable by each node for an arbitrarily chosen destination. © 2012 IEEE.

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

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