Queue-aware optimal bandwidth allocation in heterogeneous networks

Kong, F; Sun, X; Guo, YJ; Zhu, H

Queue-aware optimal bandwidth allocation in heterogeneous networks

Kong, F Sun, X Guo, YJ

Zhu, H

Permalink

Publication Type:: Journal Article
Citation:: IEEE Wireless Communications Letters, 2017, 6 (6), pp. 730 - 733
Issue Date:: 2017-12-01

Closed Access

	Filename	Description	Size
	08004477.pdf	Published Version	350.56 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	Kong, F	en_US
dc.contributor.author	Sun, X	en_US
dc.contributor.author	Guo, YJ https://orcid.org/0000-0001-6008-9682	en_US
dc.contributor.author	Zhu, H	en_US
dc.date.issued	2017-12-01	en_US
dc.identifier.citation	IEEE Wireless Communications Letters, 2017, 6 (6), pp. 730 - 733	en_US
dc.identifier.issn	2162-2337	en_US
dc.identifier.uri	http://hdl.handle.net/10453/125392
dc.description.abstract	© 2017 IEEE. This letter considers how to allocate the bandwidth to multiple radio access technologies (RATs) in heterogeneous networks. In contrast to previous studies where base stations (BSs) are assumed to be transmitting all the time, it is assumed that the incoming packets from users form a queue in each BS. A minimization problem of the network average power consumption and a maximization problem of the network signalto- interference ratio coverage are formulated, which are shown to be convex and concave with respect to the bandwidth allocation to each RAT, respectively. By using an approximation of the average traffic intensity, closed-form solutions are obtained for both problems.	en_US
dc.relation.ispartof	IEEE Wireless Communications Letters	en_US
dc.relation.isbasedon	10.1109/LWC.2017.2736979	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Queue-aware optimal bandwidth allocation in heterogeneous networks	en_US
dc.type	Journal Article
utslib.citation.volume	6	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	0805 Distributed Computing	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 - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Students
utslib.copyright.status	closed_access	*
pubs.issue	6	en_US
pubs.publication-status	Published	en_US
pubs.volume	6	en_US

Abstract:

© 2017 IEEE. This letter considers how to allocate the bandwidth to multiple radio access technologies (RATs) in heterogeneous networks. In contrast to previous studies where base stations (BSs) are assumed to be transmitting all the time, it is assumed that the incoming packets from users form a queue in each BS. A minimization problem of the network average power consumption and a maximization problem of the network signalto- interference ratio coverage are formulated, which are shown to be convex and concave with respect to the bandwidth allocation to each RAT, respectively. By using an approximation of the average traffic intensity, closed-form solutions are obtained for both problems.

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

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