DMCP: A Distributed Mobile Charging Protocol in Wireless Rechargeable Sensor Networks

On-demand charging of sensor nodes (SNs) in wireless rechargeable sensor networks (WRSNs) has garnered immense attention. Existing works with multiple mobile chargers (MCs) overlooked the benefits of partial charging and distributed control in large-scale WRSNs. Besides, most of them have not considered the complete heterogeneity of SNs’ energy profiles and idleness of the MCs. In this paper, we address the aforesaid issues and present a game theory-based distributed mobile charging protocol, called DMCP. We formulate the mobile charging problem as a series of repeated games played among the MCs and represent a game as a 0 − 1 integer linear programming to maximize the total profit of the MCs. In each game, the DMCP dynamically determines the factor of charging of the energy-deficit SNs based on their relative criticality and selects the next-to-be-recharged SNs using an efficient bi-objective payoff function. Besides, it utilizes an innovative strategy and a self-enforcing agreement to promote cooperation among the MCs. Through extensive simulations and hypothesis testing, we show that the DMCP reduces the charging delay up to \(44.04\% \) and enhances the charging coverage and survival rate up to \(45.12\% \) and \(49.97\% \) , respectively.