UAV-enabled communication using NOMA

Nasir, AA; Tuan, HD; Duong, TQ; Poor, HV

UAV-enabled communication using NOMA

Nasir, AA Tuan, HD

Duong, TQ Poor, HV

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Communications, 2019, 67 (7), pp. 5126 - 5138
Issue Date:: 2019-07-01

Closed Access

	Filename	Description	Size
	08672190.pdf	Published Version	1.35 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	Nasir, AA	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Duong, TQ	en_US
dc.contributor.author	Poor, HV	en_US
dc.date.issued	2019-07-01	en_US
dc.identifier.citation	IEEE Transactions on Communications, 2019, 67 (7), pp. 5126 - 5138	en_US
dc.identifier.issn	0090-6778	en_US
dc.identifier.uri	http://hdl.handle.net/10453/139270
dc.description.abstract	© 2019 IEEE. Unmanned aerial vehicles (UAVs) can be deployed as flying base stations (BSs) to leverage the strength of line-of-sight connections and effectively support the coverage and throughput of wireless communication. This paper considers a multiuser communication system, in which a single-antenna UAV-BS serves a large number of ground users by employing non-orthogonal multiple access (NOMA). The max-min rate optimization problem is formulated under total power, total bandwidth, UAV altitude, and antenna beamwidth constraints. The objective of max-min rate optimization is non-convex in all optimization variables, i.e., UAV altitude, transmit antenna beamwidth, power allocation, and bandwidth allocation for multiple users. A path-following algorithm is proposed to solve the formulated problem. Next, orthogonal multiple access (OMA) and dirty paper coding (DPC)-based max-min rate optimization problems are formulated and respective path-following algorithms are developed to solve them. The numerical results show that NOMA outperforms OMA and achieves rates similar to those attained by DPC. In addition, a clear rate gain is observed by jointly optimizing all the parameters rather than optimizing a subset of parameters, which confirms the desirability of their joint optimization.	en_US
dc.relation.ispartof	IEEE Transactions on Communications	en_US
dc.relation.isbasedon	10.1109/TCOMM.2019.2906622	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	UAV-enabled communication using NOMA	en_US
dc.type	Journal Article
utslib.citation.volume	7	en_US
utslib.citation.volume	67	en_US
utslib.for	1005 Communications Technologies	en_US
utslib.for	0804 Data Format	en_US
utslib.for	0906 Electrical and Electronic Engineering	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.issue	7	en_US
pubs.publication-status	Published	en_US
pubs.volume	67	en_US

Abstract:

© 2019 IEEE. Unmanned aerial vehicles (UAVs) can be deployed as flying base stations (BSs) to leverage the strength of line-of-sight connections and effectively support the coverage and throughput of wireless communication. This paper considers a multiuser communication system, in which a single-antenna UAV-BS serves a large number of ground users by employing non-orthogonal multiple access (NOMA). The max-min rate optimization problem is formulated under total power, total bandwidth, UAV altitude, and antenna beamwidth constraints. The objective of max-min rate optimization is non-convex in all optimization variables, i.e., UAV altitude, transmit antenna beamwidth, power allocation, and bandwidth allocation for multiple users. A path-following algorithm is proposed to solve the formulated problem. Next, orthogonal multiple access (OMA) and dirty paper coding (DPC)-based max-min rate optimization problems are formulated and respective path-following algorithms are developed to solve them. The numerical results show that NOMA outperforms OMA and achieves rates similar to those attained by DPC. In addition, a clear rate gain is observed by jointly optimizing all the parameters rather than optimizing a subset of parameters, which confirms the desirability of their joint optimization.

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

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