scholarly journals Wireless rechargeable sensor networks with separable charger array

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771876899 ◽  
Author(s):  
Chengjie Xu ◽  
Rei-Heng Cheng ◽  
Tung-Kuang Wu
Keyword(s):  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Computation Time ◽  
The Other ◽  
Earliest Deadline First ◽  
Battery Cell ◽  
New Model ◽  
Mobile Vehicle ◽  
Wireless Rechargeable Sensor Networks ◽  
Earliest Deadline

Wireless charging technology has been developing rapidly in recent years and has been used to deliver power and provide a new source of energy for wireless rechargeable sensor networks. With current solutions, charging is usually done by a mobile vehicle equipped with a charger, which needs to be waiting on site until the sensor is properly charged. It is possible that some sensors drain their power while the charging vehicle is serving the other. Accordingly, we proposed a solution that uses a single charging vehicle equipped with multiple battery cells, which we call the separable charging array. The battery cell can be unloaded on site with sensor, while the vehicle carries on its mission. A scheduling algorithm, a revised earliest deadline first algorithm, is proposed to work with this new model. In this study, we will demonstrate that the idea of equipping charging vehicle with separable charger array is feasible. In addition, our simulations indicate that the revised earliest deadline first scheduling algorithm does improve the earliest deadline first scheduling algorithm significantly with only minor overhead in scheduling computation time and very few extra chargers. Some modified variations of the proposed revised earliest deadline first algorithm will also be discussed and evaluated.

Evaluation of Two Mixed-Criticality Scheduling Algorithm for Periodic Tasks

2014 ◽  
Vol 513-517 ◽  
pp. 1160-1164
Author(s):  
Shu Juan Huang ◽  
Yi An Zhu
Keyword(s):  
Scheduling Algorithm ◽  
The Other ◽  
Earliest Deadline First ◽  
Periodic Tasks ◽  
System Utilization ◽  
Simulation Results ◽  
Earliest Deadline ◽  
Better Than ◽  
Mixed Criticality

Nowadays, there are two approach in mixed-criticality scheduling. One is reservations-based approach such as EDF-VD(Earliest Deadline First-Virtual Deadline) and the Other is priority-based scheduling such as OCBP(Own Criticality Based Priority). This paper compared the two mixed-criticality scheduling algorithm from three aspects. The simulation results show that EDF-VD is better than OCBP in completed tasks and the system utilization, but in unmissed deadline ratio the later owns the better.

ACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems

2013 ◽  
pp. 85-96
Author(s):  
Apurva Shah ◽  
Ketan Kotecha
Keyword(s):  
Real Time ◽  
Computational Models ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Multiprocessor Systems ◽  
Individual Agent ◽  
Collective Foraging ◽  
Time Systems ◽  
Earliest Deadline

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor real-time systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the results of Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is very efficient in underloaded conditions and it performs very well during overloaded conditions also. Moreover, the proposed algorithm can schedule some typical instances successfully which are not possible to schedule using EDF algorithm.

Energy harvesting earliest deadline first scheduling algorithm for increasing lifetime of real time systems

2019 ◽  
Vol 118 (4) ◽  
pp. 160
Author(s):  
G. Madhumita ◽  
G. Rajini ◽  
B. Subisha
Keyword(s):  
Energy Consumption ◽  
Energy Harvesting ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Real Time Systems ◽  
Tasks Scheduling ◽  
Time Systems ◽  
Earliest Deadline ◽  
Reducing Energy

In this paper, a new approach for energy minimization in energy harvesting real time systems has been investigated. Lifetime of a real time systems is depend upon its battery life.  Energy is a parameter by which the lifetime of system can be enhanced.  To work continuously and successively, energy harvesting is used as a regular source of energy. EDF (Earliest Deadline First) is a traditional real time tasks scheduling algorithm and DVS (Dynamic Voltage Scaling) is used for reducing energy consumption. In this paper, we propose an Energy Harvesting Earliest Deadline First (EH-EDF) scheduling algorithm for increasing lifetime of real time systems using DVS for reducing energy consumption and EDF for tasks scheduling with energy harvesting as regular energy supply. Our experimental results show that the proposed approach perform better to reduce energy consumption and increases the system lifetime as compared with existing approaches.  

scholarly journals A Complete Feasible and Nodes-Grouped Scheduling Algorithm for Wireless Rechargeable Sensor Networks in Tunnels

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3410 ◽  
Author(s):  
Xiaoming Liu ◽  
Yu Guo ◽  
Wen Li ◽  
Min Hua ◽  
Enjie Ding
Keyword(s):  
Sensor Networks ◽  
State Of The Art ◽  
Scheduling Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distribution Problem ◽  
Design Constraint ◽  
Charging Time ◽  
Wireless Rechargeable Sensor Networks ◽  
Charging Strategy

Limited energy in each node is the major design constraint in wireless sensor networks (WSNs), especially in mine tunnel scenario where the WSNs are required to work perpetually. To overcome this limit, wireless rechargeable sensor networks (WRSNs) have been proposed and studied extensively over the last few years. To keep the sensor nodes working perpetually, one fundamental question is how to design the charging scheme. Considering the special tunnel scenario, this paper proposes a Complete Feasible Charging Strategy (CFCS) to ensure the whole WRSNs is working perpetually. We divide the whole WRSN into several subnetworks and use several mobile chargers (MCs) to charge every subnetwork periodically and orderly. For a subnetwork, we formulate the main problem as a charging time distribution problem. A series of theorems are deduced to restrict the charging configurations, and a group nodes mechanism is proposed to expand the scale of the WRSNs. Finally, we conduct extensive simulations to evaluate the performance of the proposed algorithms. The results demonstrate which of the CFCS boundary theorems is correct and that our proposed CFCS can keep the WRSNs working perpetually. Furthermore, our Nodes-Grouped mechanism can support more nodes in WRSN compared to the state-of-the-art baseline methods.

scholarly journals Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Rashmi Sharma ◽  
Nitin
Keyword(s):  
Real Time ◽  
Distributed System ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Time System ◽  
Real Time System ◽  
Main Target ◽  
Migration Mechanism ◽  
Simulation Results ◽  
Earliest Deadline

In Real Time System, the achievement of deadline is the main target of every scheduling algorithm. Earliest Deadline First (EDF), Rate Monotonic (RM), and least Laxity First are some renowned algorithms that work well in their own context. As we know, there is a very common problem Domino's effect in EDF that is generated due to overloading condition (EDF is not working well in overloading situation). Similarly, performance of RM is degraded in underloading condition. We can say that both algorithms are complements of each other. Deadline missing in both events happens because of their utilization bounding strategy. Therefore, in this paper we are proposing a new scheduling algorithm that carries through the drawback of both existing algorithms. Joint EDF-RM scheduling algorithm is implemented in global scheduler that permits task migration mechanism in between processors in the system. In order to check the improved behavior of proposed algorithm we perform simulation. Results are achieved and evaluated in terms of Success Ratio (SR), Average CPU Utilization (ECU), Failure Ratio (FR), and Maximum Tardiness parameters. In the end, the results are compared with the existing (EDF, RM, and D_R_EDF) algorithms. It has been shown that the proposed algorithm performs better during overloading condition as well in underloading condition.

Sign in / Sign up

Export Citation Format

Share Document