Peer–Peer Communication Using Novel Slice Handover Algorithm for 5G Wireless Networks

Abstract

The goal of 5G wireless networks is to address the growing need for network services among users. User equipment has progressed to the point where users now expect diverse services from the network. The latency, reliability, and bandwidth requirements of users can all be classified. To fulfil the different needs of users in an economical manner, while guaranteeing network resources are resourcefully assigned to consumers, 5G systems plan to leverage technologies like Software Defined Networks, Network Function Virtualization, and Network Slicing. For the purpose of ensuring continuous handover among network slices, while catering to the advent of varied 5G application scenarios, new mobility management techniques must be adopted in Sliced 5G networks. Users want to travel from one region of coverage to another region without any fading in their network connection. Different network slices can coexist in 5G networks, with every slice offering services customized to various QoS demands. As a result, when customers travel from one region of coverage to another, the call can be transferred to a slice that caters to similar or slightly different requirements. The goal of this study was to develop an intra- and inter-slice algorithm for determining handover decisions in sliced 5G networks and to assess performance by comparing intra- and inter-slice handovers. The proposed work shows that an inter-slice handover algorithm offers superior quality of service when compared to an intra-slice algorithm.

Keywords

• 5G
• latency
• bandwidth
• radio
• slicing
• QoS