A STUDY ON CHANNEL AND DELAY-BASED SCHEDULING ALGORITHMS FOR LIVE VIDEO STREAMING IN THE FIFTH GENERATION LONG TERM EVOLUTION-ADVANCED

This paper investigates the performance of a number of channel and delay-based scheduling algorithms for an efficient QoS (Quality of Service) provision with more live video streaming users over the Fifth Generation Long-Term Evolution-Advanced (5G LTE-A) network. These algorithms were developed for use in legacy wireless networks and minor changes were made to enable these algorithms to perform packet scheduling in the downlink 5G LTE-A. The efficacies of the EXP and M-LWDF algorithms in maximizing the number of live video streaming users at the desired transmission reliability, minimizing the average network delay and maximizing network throughput, are shown via simulations. As the M-LWDF has a simpler mathematical equation as compared to the EXP, it is more favoured for implementation in the complex downlink 5G LTE-A. ABSTRAK: Kertas ini menyiasat prestasi sebilangan saluran dan algoritma penjadualan berdasarkan kelewatan untuk penyediaan QoS (Kualiti Perkhidmatan) yang cekap dengan banyak pengguna video secara langsung melalui rangkaian Generasi Kelima Long-Term Evolution Advanced (5G LTE-A). Algoritma-algoritma yang disiasat di dalam kertas ini dicadangkan untuk digunakan dalam generasi rangkaian tanpa wayar yang lama dan sedikit perubahan dibuat untuk membolehkan algoritma ini menyokong penjadualan paket dalam downlink 5G LTE-A. Keberkesanan EXP dan M-LWDF algoritma dalam memaksimumkan jumlah pengguna pada kebolehpercayaan transmisi yang diinginkan dari streaming video secara langsung, meminimumkan kelewatan rangkaian, dan memaksimumkan truput rangkaian ditunjukkan melalui simulasi. Namun, dengan M-LWDF mempunyai formula matematik yang mudah dibandingkan dengan EXP, ia lebih sesuai untuk digunakan dalam downlink 5G LTE-A yang lebih kompleks.

Load Balanced Multipath Routing using Seagull Optimizer Based Garson’s Pruned Recurrent Neural Network for Multipath Routing in MANET

In recent years, routing is considered one of the most challenging issues in MANET. The location of the stable node and the routing is based on the predicted locations that assists in establishing a routing path in MANET. The major intention of this paper is to detect the stable neighbor node in the MANET and also to establish stable multi-path routing for the various mobility patterns. Also, this paper deals with the data packet scheduling over multi-paths for balancing the load and forward the entire packets in the least broadcast time. The proposed approach elucidates four significant phases: stable node prediction, determination of stability measure, route exploration and packet dissemination. Initially, the stable node is predicted using the RMSG approach. Here, the stable neighbors are selected via Garson’s pruning based Recurrent neural network with a Modified seagull optimization algorithm (RMSG). In the route exploration phase, the path is created among the source and destination by the stable node. If any of the links fails, the route recovery process is established. Finally, the structure is formed for data packet distribution across the multipath. The proposed approach is evaluated by few performance measures such as throughput, packet delivery ratio, end-to-end delay, routing overhead energy consumption, and optimal path. This result describes that the proposed approach outperforms other state-of-art approaches.

FD-LTDA-MAC: Full-Duplex Unsynchronised Scheduling in Linear Underwater Acoustic Chain Networks

In-band full-duplex communication offers significant potential to enhance network performance. This paper presents the full-duplex linear transmit delay allocation MAC (FD-LTDA-MAC) protocol for full-duplex based underwater acoustic chain networks (FD-UACNs) for subsea pipeline monitoring. This incorporates a number of extensions to the LTDA-MAC protocol in order to fully exploit advantages of full-duplex communication to enhance the efficiency of underwater facility monitoring. The protocol uses a greedy optimisation algorithm to derive collision-free packet schedules for delivering data packets to the sink node of the underwater chain network. The purpose of this paper is to show the significant improvement that can be achieved in packet scheduling by exploiting temporal spectrum re-use of an underwater acoustic channel through full-duplex communication. Simulation results show that more efficient packet scheduling and reduced end-to-end packet delays can be achieved in large scale scenarios using FD-LTDA-MAC compared with LTDA-MAC and LTDA-MAC with full-duplex enabled nodes. It can provide much higher monitoring rates for long range underwater pipelines using low cost, mid range, low rate, and low power acoustic modems.

Improving scheduling performance in congested networks

With continuously rising trends in applications of information and communication technologies in diverse sectors of life, the networks are challenged to meet the stringent performance requirements. Increasing the bandwidth is one of the most common solutions to ensure that suitable resources are available to meet performance objectives such as sustained high data rates, minimal delays, and restricted delay variations. Guaranteed throughput, minimal latency, and the lowest probability of loss of the packets can ensure the quality of services over the networks. However, the traffic volumes that networks need to handle are not fixed and it changes with time, origin, and other factors. The traffic distributions generally follow some peak intervals and most of the time traffic remains on moderate levels. The network capacity determined by peak interval demands often requires higher capacities in comparison to the capacities required during the moderate intervals. Such an approach increases the cost of the network infrastructure and results in underutilized networks in moderate intervals. Suitable methods that can increase the network utilization in peak and moderate intervals can help the operators to contain the cost of network intrastate. This article proposes a novel technique to improve the network utilization and quality of services over networks by exploiting the packet scheduling-based erlang distribution of different serving areas. The experimental results show that significant improvement can be achieved in congested networks during the peak intervals with the proposed approach both in terms of utilization and quality of service in comparison to the traditional approaches of packet scheduling in the networks. Extensive experiments have been conducted to study the effects of the erlang-based packet scheduling in terms of packet-loss, end-to-end latency, delay variance and network utilization.

Packet Scheduling for Internet of Remote Things (IoRT) devices in Next Generation Satellite Networks

Background: The massive amount of deployment of Internet of Things (IoT) devices via wireless communications has presented a new paradigm in next generation mobile networks. The rapid growth in the deployment of the IoT devices can be linked to the diverse use of several IoT applications for home automations, smart systems, and other forms of innovations in businesses and industry 4.0. Methods: There is need for a robust network infrastructure to actualize the huge traffic demand of the IoT communications in this new paradigm across the globe including rural and remote areas. However, due to technical and economical constraints, the terrestrial network infrastructure is not able to fulfil this requirement. Hence, the need for satellite network infrastructure. This solution will be of inmense benefit to the provision of remote health care, disaster management, remote sensing, and asset tracking and environmental monitoring to name a few. While this remain an interesting solution, the packet scheduling which is one of the key radio resource management functions is still a challenging issue that remains undefined especially in a satellite network scenario that has its own peculiarities and challenges. Results: Hence, the goal of this research work is to design a new packet scheduling scheme that will be suitable for machine type communications and also mixed use case scenario in satellite network scenario. The performance evaluation of the proposed packet scheduler is conducted through simulations. Conclusion: The newly proposed packet scheduling scheme provides at an improvement of approximately 7 Mbps and 0.5 bps/Hz in terms of throughput and spectral efficiency performances respectively in mixed use case scenario, when compared to known throughput optimal packet schedulers, without serious compromise to other performance metrics.

Proportional fair buffer scheduling algorithm for 5G enhanced mobile broadband

The impending next generation of mobile communications denoted 5G intends to interconnect user equipment, things, vehicles, and cities. It will provide an order of magnitude improvement in performance and network efficiency, and different combinations of use cases enhanced mobile broadband (eMBB), ultra reliable low latency communications (URLLC), massive internet of things (mIoT) with new capabilities and diverse requirements. Adoption of advanced radio resource management procedures such as packet scheduling algorithms is necessary to distribute radio resources among different users efficiently. The proportional fair (PF) scheduling algorithm and its modified versions have proved to be the commonly used scheduling algorithms for their ability to provide a tradeoff between throughput and fairness. In this article, the buffer status is combined with the PF metric to suggest a new scheduling algorithm for efficient support for eMBB. The effectiveness of the proposed scheduling strategy is proved through à comprehensive experimental analysis based on the evaluation of different quality of service key performance indicators (QoS KPIs) such as throughput, fairness, and buffer status.