Survey of Various Real and Non-real-time Scheduling Algorithms in Mobile Ad hoc Networks

Sufian, Abu; Banerjee, Anuradha; Dutta, Paramartha

doi:10.1007/978-981-10-3953-9_13

Cited by 5 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RM requires the least computation because all VM's are checked in the run queue. RM is less complex than EDF in some specific scenarios because the popularity of memory-nodes has to be taken into account in EDF [33] [34] [35].…”

Section: Scheduling Overheadmentioning

confidence: 99%

Energy Reduction Through Memory Aware Real-Time Scheduling on Virtual Machine in Multi-Cores Server

et al. 2021

View full text Add to dashboard Cite

Not only weighty energy usage pose issues for the environment, but it also raises server maintenance costs in data centers. The massive task with the various power control functions in computer components was made to minimize energy consumption. Increasing consumption of energy in data server environments means that data centers will have high maintenance costs. Various geo-distributed data centers are starting to grow in an age of data proliferation and information growth. Energy management for servers is now demanded for technological, environmental, and economic reasons. In this environment, the main memory is a major energy consumer, not less than the processor. At the same time, an energy-efficient task scheduling strategy is a viable way to meet these goals. Unfortunately, mapping Virtual Machine (VM) resources to the Main Memory (MM) demands to achieve good performance by minimizing the energy consumption within a certain limit is a huge challenge. This paper simulates energy-efficient task scheduling algorithms in a heterogeneous virtualized environment using real-time virtual machine scheduling to resolve the issue of energy consumption. Using a simulator Real-Time system SIMulator (RTSIM), several hardwarebased scheduling algorithms are implemented to observe VM memory scheduling efficiency to save memory energy. The simulation results show that, compared to current energy-efficient scheduling methods Rate Monotonic (RM), Earliest-Deadline-First (EDF), and Least-Laxity-First (LLF), helps to reduce energy consumption and improve performance. It is also observed that memory-aware energy management architecture reduces energy and memory consumption efficiently by using EDF scheduling algorithms. In particular, EDF saves approximately 58.3 percent of memory energy than conventional systems that cannot benefit from memory-aware energy management algorithms. The energy efficiency of the algorithms continues to improve as the level of server consolidation rises. We also implemented the EDF scheduling algorithm in Xen's Credit scheduler to see if the simulation outcomes can be simulated on physical systems. Results of simulation and deployment are equated, and comparable outcomes are achieved. We also identified that shared memory between virtual machines deliberately affects memory's energy consumption based on the implementation.

show abstract

Section: Scheduling Overheadmentioning

confidence: 99%

Energy Reduction Through Memory Aware Real-Time Scheduling on Virtual Machine in Multi-Cores Server

et al. 2021

View full text Add to dashboard Cite

show abstract

“…The packet forwarding process needs to be considered carefully to provide a route with the best possible data packet transfer. For this purpose, the data packet scheduling method can play a significant role to accomplish this objective [42]. When any node receives forwarded packets, it starts serving only one of them while the remaining flow packets will be stored in the queue.…”

Section: Minimum Execution Time (Met) Scheduling Algorithmmentioning

confidence: 99%

A novel dynamic source routing (DSR) protocol based on minimum execution time scheduling and moth flame optimization (MET-MFO)

Almazok

Bilgehan

2020

J Wireless Com Network

View full text Add to dashboard Cite

In general, the conventional routing approaches in mobile ad hoc networks (MANETs) provide a route between the source and the target with a minimum hop count. Dynamic source routing (DSR) as a typical prototype of routing protocols relies on the minimum hop count parameter to provide the path without considering any other factors such as energy consumption and node energy level, which significantly affect the routing algorithm performance. To enhance the performance of the DSR, a novel and efficient routing mechanism based on a hybrid approach using the minimum execution time (MET) scheduling and moth flame optimization (MFO) scheme is proposed. This hybridization version of DSR is called the (MET-MFODSR) algorithm, and it aims to improve the routing mechanism through establishing an optimal route with minimum energy consumption, which increases the network lifetime and reduces route failure issues. The proposed MET-MFODSR protocol is implemented using the MATLAB platform, analyzed and evaluated in different simulation environments. The simulation results demonstrate that the suggested routing algorithm is applicative and practicable, and its performance exceeds the performance of the existing Bee DSR (BEEDSR) and Bee-inspired protocol (BeeIP) algorithms.

show abstract

An Improved Low Latency Queueing Scheduling Algorithm for MANETs

Muwumba

Eyobu

Ngubiri

2023

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Survey of Various Real and Non-real-time Scheduling Algorithms in Mobile Ad hoc Networks

Cited by 5 publications

References 21 publications

Energy Reduction Through Memory Aware Real-Time Scheduling on Virtual Machine in Multi-Cores Server

Energy Reduction Through Memory Aware Real-Time Scheduling on Virtual Machine in Multi-Cores Server

A novel dynamic source routing (DSR) protocol based on minimum execution time scheduling and moth flame optimization (MET-MFO)

An Improved Low Latency Queueing Scheduling Algorithm for MANETs

Contact Info

Product

Resources

About