Secrecy Throughput of Wireless Interference Networks with Uncertain Channel State Information

Hoang, TD; Sheng, Z; Poor, HV; Nasir, AA

Secrecy Throughput of Wireless Interference Networks with Uncertain Channel State Information

Hoang, TD

Sheng, Z

Poor, HV Nasir, AA

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: 2017 IEEE Globecom Workshops (GC Wkshps), 2017, pp. 1 - 7 (7)
Issue Date:: 2017

Closed Access

	Filename	Description	Size
	08269217.pdf	Published version	190.53 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	Hoang, TD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Sheng, Z https://orcid.org/0000-0003-0288-7031	en_US
dc.contributor.author	Poor, HV	en_US
dc.contributor.author	Nasir, AA	en_US
dc.date	2017-12-04	en_US
dc.date.issued	2017	en_US
dc.identifier.citation	2017 IEEE Globecom Workshops (GC Wkshps), 2017, pp. 1 - 7 (7)	en_US
dc.identifier.uri	http://hdl.handle.net/10453/127294
dc.description.abstract	Considering a multi-user interference network with an eavesdropper, this paper investigates the problem of power allocation to optimize the worst secrecy throughput among the network links. Three scenarios for the access of channel state information are considered: perfect channel state information, partial channel state information with channels from the transmitters to the eavesdropper exponentially distributed, and imperfectly known channels between the transmitters and the users with exponentially distributed errors. The paper develops various path-following procedures of low complexity and rapid convergence for the optimal power allocation. Their effectiveness and viability are illustrated through numerical examples. The power allocation schemes are shown to achieve high secrecy throughput.	en_US
dc.publisher	IEEE	en_US
dc.relation.ispartof	2017 IEEE Globecom Workshops (GC Wkshps)	en_US
dc.relation.ispartof	IEEE Globecom Workshops	en_US
dc.relation.isbasedon	10.1109/GLOCOMW.2017.8269217	en_US
dc.rights	© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Secrecy Throughput of Wireless Interference Networks with Uncertain Channel State Information	en_US
dc.type	Conference Proceeding
utslib.location.activity	Singapore, Singapore	en_US
utslib.for	0805 Distributed Computing	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
utslib.copyright.status	closed_access	*
pubs.declined	2018-08-23T14:01:56.426+1000
pubs.consider-herdc	true	en_US
pubs.deleted	2018-08-23T14:01:56.426+1000
pubs.finish-date	2017-12-08	en_US
pubs.publication-status	Published	en_US
pubs.start-date	2017-12-04	en_US

Abstract:

Considering a multi-user interference network with an eavesdropper, this paper investigates the problem of power allocation to optimize the worst secrecy throughput among the network links. Three scenarios for the access of channel state information are considered: perfect channel state information, partial channel state information with channels from the transmitters to the eavesdropper exponentially distributed, and imperfectly known channels between the transmitters and the users with exponentially distributed errors. The paper develops various path-following procedures of low complexity and rapid convergence for the optimal power allocation. Their effectiveness and viability are illustrated through numerical examples. The power allocation schemes are shown to achieve high secrecy throughput.

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

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