2D proactive uplink resource allocation algorithm for event based MTC applications

Vu, TT; Nguyen, DN; Dutkiewicz, E

2D proactive uplink resource allocation algorithm for event based MTC applications

Vu, TT

Nguyen, DN

Dutkiewicz, E

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Wireless Communications and Networking Conference, WCNC, 2018, 2018-April pp. 1 - 6
Issue Date:: 2018-06-08

Closed Access

	Filename	Description	Size
	2D Proactive Uplink Resource Allocation Algorithm.pdf	Published version	764.85 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	Vu, TT https://orcid.org/0000-0002-9826-3321	en_US
dc.contributor.author	Nguyen, DN https://orcid.org/0000-0003-2659-8648	en_US
dc.contributor.author	Dutkiewicz, E https://orcid.org/0000-0002-4268-9286	en_US
dc.date.available	2017-12-10	en_US
dc.date.issued	2018-06-08	en_US
dc.identifier.citation	IEEE Wireless Communications and Networking Conference, WCNC, 2018, 2018-April pp. 1 - 6	en_US
dc.identifier.isbn	9781538617342	en_US
dc.identifier.issn	1525-3511	en_US
dc.identifier.uri	http://hdl.handle.net/10453/128511
dc.description.abstract	© 2018 IEEE. We propose a two dimension (2D) proactive uplink resource allocation (2D-PURA) algorithm that aims to reduce the delay/latency in event-based machine-type communications (MTC) applications. Specifically, when an event of interest occurs at a device, it tends to spread to the neighboring devices. Consequently, when a device has data to send to the base station (BS), its neighbors later are highly likely to transmit. Thus, we propose to cluster devices in the neighborhood around the event, also referred to as the disturbance region, into rings based on the distance from the original event. To reduce the uplink latency, we then proactively allocate resources for these rings. To evaluate the proposed algorithm, we analytically derive the mean uplink delay, the proportion of resource conservation due to successful allocations, and the proportion of uplink resource wastage due to unsuccessful allocations for 2D-PURA algorithm. Numerical results demonstrate that the proposed method can save over 16.5 and 27 percent of mean uplink delay, compared with the 1D algorithm and the standard method, respectively.	en_US
dc.relation.ispartof	IEEE Wireless Communications and Networking Conference, WCNC	en_US
dc.relation.isbasedon	10.1109/WCNC.2018.8377353	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	2D proactive uplink resource allocation algorithm for event based MTC applications	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2018-April	en_US
utslib.for	0906 Electrical and Electronic Engineering	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
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.publication-status	Published	en_US
pubs.volume	2018-April	en_US

Abstract:

© 2018 IEEE. We propose a two dimension (2D) proactive uplink resource allocation (2D-PURA) algorithm that aims to reduce the delay/latency in event-based machine-type communications (MTC) applications. Specifically, when an event of interest occurs at a device, it tends to spread to the neighboring devices. Consequently, when a device has data to send to the base station (BS), its neighbors later are highly likely to transmit. Thus, we propose to cluster devices in the neighborhood around the event, also referred to as the disturbance region, into rings based on the distance from the original event. To reduce the uplink latency, we then proactively allocate resources for these rings. To evaluate the proposed algorithm, we analytically derive the mean uplink delay, the proportion of resource conservation due to successful allocations, and the proportion of uplink resource wastage due to unsuccessful allocations for 2D-PURA algorithm. Numerical results demonstrate that the proposed method can save over 16.5 and 27 percent of mean uplink delay, compared with the 1D algorithm and the standard method, respectively.

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

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