Importance-Different Charging Scheduling Based on Matroid Theory for Wireless Rechargeable Sensor Networks

Charging scheduling plays a significant role in wireless rechargeable sensor networks (WRSNs), which benefit from stable and reliable energy supplements via wireless charging. This paper proposes an importance-different charging scheduling (IDCS) strategy for improving charging utility as well as reducing the data loss. The unique feature of IDCS is that, it distinguishes nodes by means of different importance of data delivery. The Matroid theory is used to achieve our goals. First, two important factors are determined in the Matroid model, i.e., the deadline of the task and the penalty value of the task. Moreover, a greedy algorithm of task classification is designed to minimize the data loss. All tasks are divided into the early tasks and the delayed tasks, and the node with greater importance and shorter deadline has a higher priority of being included into the early tasks. In addition, a charging sequence adjustment approach is proposed to maximize the charging utility. This approach aims to exchange the sequence of different nodes in the trajectory of the mobile charger for exploring a shorter path. Several simulations verified the effectiveness and advantages of our charging scheduling strategy in terms of the node failure rate and total data loss.