University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Dynamic Preamble Subset Allocation for RAN Slicing in 5G Networks

Vural, Serdar, Wang, Ning, Bucknell, Paul, Foster, Gerard, Tafazolli, Rahim and Muller, Julien (2018) Dynamic Preamble Subset Allocation for RAN Slicing in 5G Networks IEEE Access, 6. pp. 13015-13032.

[img]
Preview
Text
Dynamic Preamble Subset Allocation for RAN Slicing in 5G Networks.pdf - Accepted version Manuscript

Download (1MB) | Preview

Abstract

The random access (RA) mechanism of Long Term Evolution (LTE) networks is prone to congestion when a large number of devices attempt RA simultaneously, due to the limited set of preambles. If each RA attempt is made by means of transmission of multiple consecutive preambles (codewords) picked from a subset of preambles, as proposed in [1], collision probability can be significantly reduced. Selection of an optimal preamble set size [2] can maximise RA success probability in the presence of a trade-off between codeword ambiguity and code collision probability, depending on load conditions. In light of this finding, this paper provides an adaptive algorithm, called Multipreamble RA, to dynamically determine the preamble set size in different load conditions, using only the minimum necessary uplink resources. This provides high RA success probability, and makes it possible to isolate different network service classes by separating the whole preamble set into subsets each associated to a different service class; a technique that cannot be applied effectively in LTE due to increased collision probability. This motivates the idea that preamble allocation could be implemented as a virtual network function, called vPreamble, as part of a random access network (RAN) slice. The parameters of a vPreamble instance can be configured and modified according to the load conditions of the service class it is associated to.

Item Type: Article
Divisions : Faculty of Engineering and Physical Sciences > Electronic Engineering
Authors :
NameEmailORCID
Vural, SerdarS.Vural@surrey.ac.uk
Wang, NingN.Wang@surrey.ac.uk
Bucknell, Paul
Foster, Gerard
Tafazolli, RahimR.Tafazolli@surrey.ac.uk
Muller, Julien
Date : 31 January 2018
Identification Number : 10.1109/ACCESS.2018.2800661
Copyright Disclaimer : © 2018 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Uncontrolled Keywords : LTE; Mobile networks; Random access; Network slicing; RACH; Congestion reduction; Analysis; Simulations; Coded random access
Depositing User : Clive Harris
Date Deposited : 08 Feb 2018 09:23
Last Modified : 14 May 2018 08:50
URI: http://epubs.surrey.ac.uk/id/eprint/845777

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800