Optimizing Mobile Charger Scheduling in Wireless Rechargeable Sensor Networks Using Min-Heap Algorithm

In Wireless Rechargeable Sensor Networks (WRSNs), efficient energy management is crucial for prolonging network lifetime. Mobile Charging Vehicles (MCVs) play a vital role in replenishing the energy of sensor nodes (SNs); but optimizing their scheduling to minimize energy depletion and maximize network coverage remains a significant challenge till date. This paper proposes a novel scheduling approach based on the Min Heap algorithm to optimize the deployment of MCVs in WRSNs. By prioritizing SNs with the lowest remaining energy, the Min-heap algorithm dynamically adjusts the charging sequence, reducing the risk of node failures and improving overall network performance. To show the effectiveness of the proposed scheme, extensive simulations have been done by using MATLAB. Simulation results demonstrate that the proposed approach significantly improves the performance in terms of working time, total energy received, ratio of successful energy replacement and moving distance as compared to traditional scheduling approaches such as EDF and ETLBO.

Authors

Institutions

Publication Details

Published
2024-12-22
DOI
https://doi.org/10.1109/cicn63059.2024.10847562
Primary Topic
IoT-based Smart Home Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Mobile Charger Scheduling in Wireless Rechargeable Sensor Networks Using Min-Heap Algorithm

Abhijit Chandra, Md. Kamaruzzaman
IoT-based Smart Home Systems
article

Optimizing Mobile Charger Scheduling in Wireless Rechargeable Sensor Networks Using Min-Heap Algorithm

Abhijit Chandra, Md. Kamaruzzaman
article en

Abstract

In Wireless Rechargeable Sensor Networks (WRSNs), efficient energy management is crucial for prolonging network lifetime. Mobile Charging Vehicles (MCVs) play a vital role in replenishing the energy of sensor nodes (SNs); but optimizing their scheduling to minimize energy depletion and maximize network coverage remains a significant challenge till date. This paper proposes a novel scheduling approach based on the Min Heap algorithm to optimize the deployment of MCVs in WRSNs. By prioritizing SNs with the lowest remaining energy, the Min-heap algorithm dynamically adjusts the charging sequence, reducing the risk of node failures and improving overall network performance. To show the effectiveness of the proposed scheme, extensive simulations have been done by using MATLAB. Simulation results demonstrate that the proposed approach significantly improves the performance in terms of working time, total energy received, ratio of successful energy replacement and moving distance as compared to traditional scheduling approaches such as EDF and ETLBO.

Jadavpur University (IN)
Affordable and clean energy
Openalex Percentile: Top 76%
IoT-based Smart Home Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimizing Mobile Charger Scheduling in Wireless Rechargeable Sensor Networks Using Min-Heap Algorithm — Abhijit Chandra, Md. Kamaruzzaman · (2024) | TGRS Research Map | TGRS