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.
10 August 2016 in Advances in Computer Science and Engineering
In most distributed systems, naming of nodes for low-level communication leverages topological location (such as node addresses) and is independent of any application. In this paper, we investigate an emerging class of distributed systems where low-level communication does not rely on network topological location. Rather, low-level communication is based on attributes that are external to the network topology and relevant to the application. When combined with dense deployment of nodes, this kind of named data enables in-network processing for data aggregation, collaborative signal processing, and similar problems. These approaches are essential for emerging applications such as sensor networks where resources such as bandwidth and energy are limited. This paper is the first description of the software architecture that supports named data and in-network processing in an operational, multi-application sensor-network. We show that approaches such as in-network aggregation and nested queries can significantly affect network traffic. In one experiment aggregation reduces traffic by up to 42% and nested queries reduce loss rates by 30%. Although aggregation has been previously studied in simulation, this paper demonstrates nested queries as another form of in-network processing, and it presents the first evaluation of these approaches over an operational test bed.