An Efficient Wireless Recharging Mechanism for Achieving Perpetual Lifetime of Wireless Sensor Networks

Hongli Yu, Guilin Chen, Shenghui Zhao, Chih-Yung Chang, Yu-Ting Cheng2017 · DOI

TL;DR

This paper introduces a novel "recharging while moving" mechanism for wireless sensor networks (WSNs) that significantly reduces the recharging path length and improves energy efficiency. By constructing optimized recharging segments and intelligently grouping sensors, the proposed Recharging Path Construction (RPC) algorithm aims to achieve a perpetual network lifetime, a critical challenge for battery-powered WSNs.

What Problem Does This Paper Address?

Wireless Sensor Networks (WSNs) are increasingly deployed for various monitoring tasks, but their reliance on batteries limits their operational lifetime. While energy conservation is one approach, it's insufficient for long-term operation. Energy replenishment, particularly through mobile rechargers, offers a solution. However, existing methods often require the recharger to stop at each sensor, leading to inefficient movement and long recharging paths. Furthermore, some approaches struggle with unstable environmental energy sources or complex deployment of recharging infrastructure. This paper tackles the challenge of efficiently recharging sensors with a mobile recharger, focusing on minimizing travel time and maximizing recharging effectiveness to ensure a perpetual network lifetime.

Methods

The proposed Recharging Path Construction (RPC) algorithm is a multi-phase approach designed to optimize the recharging path for a mobile recharger.

  • Initial Recharging Path Construction (IRPC) Phase: This phase constructs an initial path that passes through all sensors. It starts by identifying the southeastmost sensor and then iteratively builds a convex polygon encompassing all sensors, renumbering them to start from the sink node.
  • Partitioning Phase: The ordered sensors from the IRPC phase are then partitioned into three groups, each containing three sensors. This grouping is crucial for the next phase, as it allows for localized path reduction using geometric properties.
  • Inner-Group Path Reduction Phase: Within each group of three sensors, the algorithm constructs a "recharging segment" for each sensor. This segment is designed such that the mobile recharger can traverse it at a constant speed and fully recharge the sensor's battery. The key idea here is to reduce the path length by finding an optimal segment within the sensor's recharging range, leveraging the triangle inequality property.
  • Inter-Group Path Reduction Phase: This final phase interconnects the reduced subpaths of all groups to form a complete recharging path for each partition. The algorithm then selects the shortest among these partition paths as the final recharging path, further optimizing for length and efficiency.

A core innovation is the "recharging while moving" concept, allowing the recharger to recharge sensors without stopping, thus improving efficiency. The algorithm also incorporates a sensor recharging model based on Friis's free space equation to estimate received power and ensure sufficient energy transfer.

Datasets

Not discussed in the paper. The paper uses simulated sensor deployments within a defined area (400m x 400m) with varying numbers of sensors (5-30) and different deployment scenarios (distributed, centralized, and combined).

Key Insights and Ideas

  • "Recharging While Moving" is Key: The fundamental insight is that a mobile recharger doesn't need to stop to recharge. By moving within a sensor's recharging range and traversing a specifically designed segment, efficient recharging can occur, drastically reducing travel time.
  • Geometric Optimization for Path Reduction: The use of geometric properties, specifically the triangle inequality within groups of three sensors, is a clever way to reduce local path lengths. This allows for significant savings compared to simply visiting each sensor sequentially.
  • Hierarchical Approach for Scalability: Breaking down the problem into initial path construction, partitioning, local reduction, and then global path selection provides a structured and potentially scalable way to manage complex recharging routes in larger WSNs.
  • Balancing Recharging and Movement: The RPC algorithm implicitly balances the need for sufficient recharging time with the desire to minimize movement time, a critical trade-off for achieving perpetual lifetime.

Key Results

The paper demonstrates that the proposed RPC algorithm significantly outperforms existing methods (HAM-based, OWER-MDG) in terms of recharging path length across various deployment scenarios.

  • Path Length Reduction: The RPC algorithm consistently achieved shorter recharging paths compared to HAM-based and OWER-MDG mechanisms, often approaching the performance of a "near optimal" mechanism derived through exhaustive search.
  • Energy Efficiency: While the near-optimal mechanism generally showed the best energy efficiency, the RPC algorithm was shown to consume less energy than HAM-based and OWER-MDG, indicating improved energy utilization.
  • "Recharging While Moving" Impact: The "recharging while moving" concept was shown to be effective in reducing the overall travel time for the mobile recharger.
  • Clustering Impact: The paper highlights that different clustering strategies within the RPC algorithm can yield varying results, suggesting that the optimal clustering might depend on sensor distribution.

Limitations and Future Work

  • Near Optimal vs. Optimal: The paper compares its RPC algorithm against a "near optimal" mechanism derived from exhaustive search. While this provides a strong benchmark, it acknowledges that a true optimal solution might be computationally prohibitive.
  • Sensor Recharging Model Simplifications: The recharging model relies on certain assumptions, such as a fixed rectifier efficiency and a simplified Friis transmission equation. Real-world scenarios might involve more complex energy transfer dynamics.
  • Constant Speed Assumption: The RPC algorithm assumes the mobile recharger moves at a constant speed. Deviations from this could impact recharging efficiency and the guarantee of full recharge.
  • Future Work: The paper suggests exploring more advanced clustering mechanisms and investigating the impact of dynamic sensor node failures or mobility on the recharging path. Further research could also focus on adaptive recharging strategies that adjust based on real-time energy levels and network conditions.

Summary updated

BibTeX
@misc{yu2017efficient,
  author = {Hongli Yu and Guilin Chen and Shenghui Zhao and Chih-Yung Chang and Yu-Ting Cheng},
  title = {{An Efficient Wireless Recharging Mechanism for Achieving Perpetual Lifetime of Wireless Sensor Networks}},
  year = {2017},
  doi = {10.3390/s17010013},
}
Figure