MPSA: A real‐time collaborative scheduling algorithm for wireless rechargeable sensor networks

2021 ◽  
Author(s):  
Kun Wang ◽  
Gang Zeng ◽  
Lei Wang ◽  
Ziyu Yang
Keyword(s):  
Sensor Networks ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Collaborative Scheduling ◽  
Wireless Rechargeable Sensor Networks

TSCA: A Temporal-Spatial Real-Time Charging Scheduling Algorithm for On-Demand Architecture in Wireless Rechargeable Sensor Networks

2018 ◽  
Vol 17 (1) ◽  
pp. 211-224 ◽  
Author(s):  
Chi Lin ◽  
Jingzhe Zhou ◽  
Chunyang Guo ◽  
Houbing Song ◽  
Guowei Wu ◽  
...  
Keyword(s):  
Sensor Networks ◽  
Real Time ◽  
Scheduling Algorithm ◽  
On Demand ◽  
Wireless Rechargeable Sensor Networks

scholarly journals A Distance-Based Scheduling Algorithm With a Proactive Bottleneck Removal Mechanism for Wireless Rechargeable Sensor Networks

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 148906-148925
Author(s):  
Rei-Heng Cheng ◽  
Chang Wu Yu ◽  
Chengjie Xu ◽  
Tung-Kuang Wu
Keyword(s):  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Removal Mechanism ◽  
Wireless Rechargeable Sensor Networks

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 RCSS: A Real-Time On-Demand Charging Scheduling Scheme for Wireless Rechargeable Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (5) ◽  
pp. 1601 ◽  
Author(s):  
Ping Zhong ◽  
Yiwen Zhang ◽  
Shuaihua Ma ◽  
Xiaoyan Kui ◽  
Jianliang Gao
Keyword(s):  
Sensor Networks ◽  
Real Time ◽  
Scheduling Scheme ◽  
On Demand ◽  
Wireless Rechargeable Sensor Networks

An Adaptive Scheduling Algorithm for Real-Time Business over Bluetooth Sensor Networks

2014 ◽  
Vol 602-605 ◽  
pp. 3123-3126
Author(s):  
Yuan Li ◽  
Hua Long ◽  
Li Jun Deng ◽  
Xu Hong
Keyword(s):  
Sensor Networks ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Arrival Rate ◽  
Adaptive Scheduling ◽  
Traditional Scheduling ◽  
Bandwidth Utilization ◽  
Current Channel ◽  
Channel Quality ◽  
Simulation Results

Regarding the scheduling problem for real-time business over Bluetooth sensor networks, an adaptive scheduling algorithm for real-time business over Bluetooth sensor networks was proposed. By evaluating the current channel quality and data arrival rate, the best scheduling interval was computed for each link with real-time business. Master maintained a slot counter for each link and determined whether to schedule this link by comparing if the value of slot counter reached the best scheduling interval. The simulation results indicate that this algorithm has better bandwidth utilization, higher fairness and lower scheduling delay than traditional scheduling algorithms.

SAS-TDMA: a source aware scheduling algorithm for real-time communication in industrial wireless sensor networks

2012 ◽  
Vol 19 (6) ◽  
pp. 1155-1170 ◽  
Author(s):  
Wei Shen ◽  
Tingting Zhang ◽  
Mikael Gidlund ◽  
Felix Dobslaw
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Industrial Wireless Sensor Networks

scholarly journals A New Intra-Cluster Scheduling Scheme for Real-Time Flows in Wireless Sensor Networks

Electronics ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 683
Author(s):  
Gohar Ali ◽  
Fernando Moreira ◽  
Omar Alfandi ◽  
Babar Shah ◽  
Mohammed Ilyas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Time Frame ◽  
Acceptance Rate ◽  
Wireless Sensor ◽  
Schedule Length ◽  
Cluster Scheduling ◽  
Empty Time

Real-time flows using time division multiple access (TDMA) scheduling in cluster-based wireless sensor networks try to schedule more flows per time frame to minimize the schedule length to meet the deadline. The problem with the previously used cluster-based scheduling algorithm is that intra-cluster scheduling does not consider that the clusters may have internal or outgoing flows. Thus, intra-cluster scheduling algorithms do not utilize their empty time-slots and thus increase schedule length. In this paper, we propose a new intra-cluster scheduling algorithm by considering that clusters may have having internal or outgoing flows. Thus, intra-cluster scheduling algorithms do not differentiate the intra-cluster time slots and utilize their empty time slots. The objective is to schedule more flows per time frame, to reduce schedule length and improve the acceptance rate of flows. Simulation results show that the acceptance rate of the proposed scheme has a higher performance than the previous scheme.

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.

Sign in / Sign up

Export Citation Format

Share Document