Connectivity of wireless information-theoretic secure networks

Yang, T; Mao, G; Zhang, W

Connectivity of wireless information-theoretic secure networks

Yang, T Mao, G

Zhang, W

Permalink

Publication Type:: Conference Proceeding
Citation:: 2014 IEEE Global Communications Conference, GLOBECOM 2014, 2014, pp. 317 - 323
Issue Date:: 2014-02-09

Closed Access

	Filename	Description	Size
	c.pdf	Published version	387.02 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	2014-02-09	en_US
dc.identifier.citation	2014 IEEE Global Communications Conference, GLOBECOM 2014, 2014, pp. 317 - 323	en_US
dc.identifier.isbn	9781479935116	en_US
dc.identifier.uri	http://hdl.handle.net/10453/121607
dc.description.abstract	© 2014 IEEE. Connectivity is one of the most fundamental properties of wireless multi-hop networks. This paper studies the connectivity of large wireless networks with secrecy constraint, i.e. a pair of nodes can communicate securely against eavesdropping. Specifically, we consider a network with a mixture of legitimate nodes and eavesdroppers that are distributed according to two independent Poisson point processes on a √n × √n square. Assuming that legitimate nodes can generate artificial noise, which is shown in the literature to be an effective way of suppressing eavesdropping, we provide sufficient conditions on the transmission power and the noise generation power required for a network with known intensity of eavesdroppers to be asymptotically almost surely connected with secrecy constraint as n → ∞, considering the cases of both non-colluding and colluding eavesdroppers.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP120102030
dc.relation	http://purl.org/au-research/grants/arc/DP110100538
dc.relation.ispartof	2014 IEEE Global Communications Conference, GLOBECOM 2014	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2014.7036827	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Connectivity of wireless information-theoretic secure networks	en_US
dc.type	Conference Proceeding
utslib.for	080501 Distributed and Grid Systems	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:

© 2014 IEEE. Connectivity is one of the most fundamental properties of wireless multi-hop networks. This paper studies the connectivity of large wireless networks with secrecy constraint, i.e. a pair of nodes can communicate securely against eavesdropping. Specifically, we consider a network with a mixture of legitimate nodes and eavesdroppers that are distributed according to two independent Poisson point processes on a √n × √n square. Assuming that legitimate nodes can generate artificial noise, which is shown in the literature to be an effective way of suppressing eavesdropping, we provide sufficient conditions on the transmission power and the noise generation power required for a network with known intensity of eavesdroppers to be asymptotically almost surely connected with secrecy constraint as n → ∞, considering the cases of both non-colluding and colluding eavesdroppers.

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

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