Can LTE-A Support Real-Time Smart Meter Traffic in the Smart Grid?

The chapter investigates the scheduling load added on a long-term evolution (LTE) and/or LTE-Advanced (LTEA) network when automatic meter reading (AMR) in advanced metering infrastructures (AMI) is performed using internet of things (IoT) deployments of smart meters in the smart grid. First, radio resource management algorithms to perform dynamic scheduling of the meter transmissions are proposed and shown to allow the accommodation of a large number of smart meters within a limited coverage area. Then, potential techniques for reducing the signaling load between the meters and base stations are proposed and analyzed. Afterwards, advanced concepts from LTE-A, namely carrier aggregation (CA) and relay stations (RSs) are investigated in conjunction with the proposed algorithms in order to accommodate a larger number of smart meters without disturbing cellular communications.

Dynamic resource management algorithms for interference prediction in 5G new radio scenarios

Efficient Radio Resource Management is a key mechanism in interference management in 5G New Radio (NR) networks, specifically in the case of the presence of mobile users moving at high speed. To this end, the prediction and the evaluation of the propagation channel sensitivity requires that the radio resources allocation in NR must be efficient and powerful. Therefore, several scheduling algorithms have been developed and tested using the mmWave model of NS-3 simulator, with the aim of enhancing their contribution to improving the quality of the signal received by users. The performances have been evaluated in terms of Signal-to-Interference-and-Noise-Ratio (SINR) and signal Block Error Rate (BLER). The simulations were run for different types of data flows, and achieved satisfactory results for most schemes. The achievements clearly show the importance of scheduling algorithms in lowering received interference, but they have also demonstrated the stability and reliability of some of those strategies.

Optimization-Based Resource Management Algorithms with Considerations of Client Satisfaction and High Availability in Elastic 5G Network Slices

A combined edge and core cloud computing environment is a novel solution in 5G network slices. The clients’ high availability requirement is a challenge because it limits the possible admission control in front of the edge cloud. This work proposes an orchestrator with a mathematical programming model in a global viewpoint to solve resource management problems and satisfying the clients’ high availability requirements. The proposed Lagrangian relaxation-based approach is adopted to solve the problems at a near-optimal level for increasing the system revenue. A promising and straightforward resource management approach and several experimental cases are used to evaluate the efficiency and effectiveness. Preliminary results are presented as performance evaluations to verify the proposed approach’s suitability for edge and core cloud computing environments. The proposed orchestrator significantly enables the network slicing services and efficiently enhances the clients’ satisfaction of high availability.

Resource Management Techniques for Cloud/Fog and Edge Computing: An Evaluation Framework and Classification

Processing IoT applications directly in the cloud may not be the most efficient solution for each IoT scenario, especially for time-sensitive applications. A promising alternative is to use fog and edge computing, which address the issue of managing the large data bandwidth needed by end devices. These paradigms impose to process the large amounts of generated data close to the data sources rather than in the cloud. One of the considerations of cloud-based IoT environments is resource management, which typically revolves around resource allocation, workload balance, resource provisioning, task scheduling, and QoS to achieve performance improvements. In this paper, we review resource management techniques that can be applied for cloud, fog, and edge computing. The goal of this review is to provide an evaluation framework of metrics for resource management algorithms aiming at the cloud/fog and edge environments. To this end, we first address research challenges on resource management techniques in that domain. Consequently, we classify current research contributions to support in conducting an evaluation framework. One of the main contributions is an overview and analysis of research papers addressing resource management techniques. Concluding, this review highlights opportunities of using resource management techniques within the cloud/fog/edge paradigm. This practice is still at early development and barriers need to be overcome.

Low-latency and energy-efficient scheduling in fog-based IoT applications

In today’s world, the internet of things (IoT) is developing rapidly. Wireless sensor network (WSN) as an infrastructure of IoT has limitations in the processing power, storage, and delay for data transfer to cloud. The large volume of generated data and their transmission between WSNs and cloud are serious challenges. Fog computing (FC) as an extension of cloud to the edge of the network reduces latency and traffic; thus, it is very useful in IoT applications such as healthcare applications, wearables, intelligent transportation systems, and smart cities. Resource allocation and task scheduling are the NP-hard issues in FC. Each application includes several modules that require resources to run. Fog devices (FDs) have the ability to run resource management algorithms because of their proximity to sensors and cloud as well as the proper processing power. In this paper, we review the scheduling strategies and parameters as well as providing a greedy knapsack-based scheduling (GKS) algorithm for allocating resources appropriately to modules in fog network. Our proposed method was simulated in iFogsim as a standard simulator for FC. The results show that the energy consumption, execution cost, and sensor lifetime in GKS are better than those of the first-come-first-served (FCFS), concurrent, and delay-priority algorithms.