Connectivity of large-scale CSMA networks

Yang, T; Mao, G; Zhang, W

Connectivity of large-scale CSMA networks

Yang, T Mao, G

Zhang, W

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Wireless Communications, 2012, 11 (6), pp. 2266 - 2275
Issue Date:: 2012-06-01

Closed Access

	Filename	Description	Size
	2013001246OK.pdf		729.59 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	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-06-01	en_US
dc.identifier.citation	IEEE Transactions on Wireless Communications, 2012, 11 (6), pp. 2266 - 2275	en_US
dc.identifier.issn	1536-1276	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28431
dc.description.abstract	Wireless multi-hop networks are being increasingly used in military and civilian applications. Connectivity is a prerequisite in wireless multi-hop networks for providing many network functions. In a wireless network with many concurrent transmissions, signals transmitted at the same time will mutually interfere with each other. In this paper we consider the impact of interference on the connectivity of CSMA networks. Specifically, consider a network with n nodes uniformly and i.i.d. on a square [-√n/2,√n/2] 2 where a node can only transmit if the sensed power from any other active transmitter is below a threshold, i.e. subject to the carrier-sensing constraint, and the transmission is successful if and only if the SINR is greater than or equal to a predefined threshold. We provide a sufficient condition and a necessary condition, i.e. an upper bound and a lower bound on the transmission power, required for the above network to be asymptotically almost surely (a.a.s.)connected as n → ∞. The two bounds differ by a constant factor only as n → ∞. It is shown that the transmission power only needs to be increased by a constant factor to combat interference and maintain connectivity compared with that considering a unit disk model (UDM) without interference. This result is also in stark contrast with previous results considering the connectivity of ALOHA networks under the SINR model. © 2012 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Wireless Communications	en_US
dc.relation.isbasedon	10.1109/TWC.2012.041912.111475	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Connectivity of large-scale CSMA networks	en_US
dc.type	Journal Article
utslib.citation.volume	6	en_US
utslib.citation.volume	11	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	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.issue	6	en_US
pubs.publication-status	Published	en_US
pubs.volume	11	en_US

Abstract:

Wireless multi-hop networks are being increasingly used in military and civilian applications. Connectivity is a prerequisite in wireless multi-hop networks for providing many network functions. In a wireless network with many concurrent transmissions, signals transmitted at the same time will mutually interfere with each other. In this paper we consider the impact of interference on the connectivity of CSMA networks. Specifically, consider a network with n nodes uniformly and i.i.d. on a square [-√n/2,√n/2] 2 where a node can only transmit if the sensed power from any other active transmitter is below a threshold, i.e. subject to the carrier-sensing constraint, and the transmission is successful if and only if the SINR is greater than or equal to a predefined threshold. We provide a sufficient condition and a necessary condition, i.e. an upper bound and a lower bound on the transmission power, required for the above network to be asymptotically almost surely (a.a.s.)connected as n → ∞. The two bounds differ by a constant factor only as n → ∞. It is shown that the transmission power only needs to be increased by a constant factor to combat interference and maintain connectivity compared with that considering a unit disk model (UDM) without interference. This result is also in stark contrast with previous results considering the connectivity of ALOHA networks under the SINR model. © 2012 IEEE.

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

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