Autonomous mobile chargers for rechargeable sensor networks using space filling curve

Abstract

Recent breakthrough in the wireless energy transfer have attracted attention of the researchers due to its potential to prolong the lifetime of Wireless Sensor Networks (WSNs) and to eliminate energy bottlenecks. Through wireless charging vehicles sensor node's energy can be replenished periodically by using Wireless Charging Vehicles (WCVs). However, for a large scale WSN, the capacity of WCVs, positioning and coordination between them, and limited resources of WCVs have to be considered to implement a scalable charging system. Additionally, creating an efficient charging route for the WCVs considering the dynamic energy consumption of sensor nodes is also crucial. Since, WCVs have limited capacity and low system resources, the classic TSP-based Optimization algorithms, which requires high-performance computing, are not suitable for them. In this paper, we proposed GHSC (Guided Hilbert for Specified Cluster), which is based on the Hilbert space filling curve. We consider a clustered WSN with multiple WCVs, where each cluster is assigned to a single WCV. GHSC creates a primary charging route by considering a cluster as an unit square and dividing the square into small sub-squares. As the Hilbert curve goes through each sub-squares, the algorithm assigns a rank for each of them based on their position along the curve. The algorithm then map the nodes into vertices of the sub-squares and rank the nodes as well. Once ranking is done, the algorithm creates a charging route based on the node's ranking. This heuristic approach of the GHSC algorithm can find effective charging tours for the WCVs with a time complexity of (O(n log n) + ?(nk)). Compared to other Global Optimization algorithms, GHSC was able to find tours, which was at most a logarithmic factor longer than the shortest tour.