The exponential growth of mobile data traffic and a limited number of spectrum resources has been a big challenge for cellular network providers, henceforth traffic offloading has become one of the most critical issues especially in 5G Heterogeneous Networks (HetNets). Further, network selection plays a vital role for traffic offloading in a cellular network to maintain Quality of Service (QoS), increasing offloading efficiency and throughput. In order to efficiently utilize spectral resources, a Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) algorithm is proposed to be used for ranking a candidate network. The proposed algorithm helps in alleviating the spectrum shortage by offloading the data traffic over Wi-Fi network using unlicensed spectrum. In this work, analysis of the performance of the proposed system model through simulation of an analytical framework has been made. The results have been accumulated in terms of cumulative handover, throughput, the extent of equilibrium & offloading efficiency with respect to residence time and the number of Wi-Fi Access Points (AP's). Analysis proves that the proposed algorithm improves the equilibrium extent and throughput as compared to traditional Load balancing (LB) and SDN based LB mechanisms. It also shows that offloading efficiency is highly improved over Wi-Fi density and residence time.
Optimal random network coding is reduced complexity in computation of coding coefficients, computation of encoded packets and coefficients are such that minimal transmission bandwidth is enough to transmit coding coefficient to the destinations and decoding process can be carried out as soon as encoded packets are started being received at the destination and decoding process has lower computational complexity. But in traditional random network coding, decoding process is possible only after receiving all encoded packets at receiving nodes. Optimal random network coding also reduces the cost of computation. In this research work, coding coefficient matrix size is determined by the size of layers which defines the number of symbols or packets being involved in coding process. Coding coefficient matrix elements are defined such that it has minimal operations of addition and multiplication during coding and decoding process reducing computational complexity by introducing sparseness in coding coefficients and partial decoding is also possible with the given coding coefficient matrix with systematic sparseness in coding coefficients resulting lower triangular coding coefficients matrix. For the optimal utility of computational resources, depending upon the computational resources unoccupied such as memory available resources budget tuned windowing size is used to define the size of the coefficient matrix.
Keywords-Coding coefficients; computational complexity; lower triangular matrix; random network coding; sparse coding coefficients
I. INTRODUCTIONITH the increase in the user's high data demand, the scientists and researchers around the globe are working together to achieve a higher data rate. The third generation 3GPP are planning to launch 5G standards until 2020.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.