Coverage Control in Heterogeneous Mobile Sensor Networks Based on Game Theory

One of the fundamental problems in wireless sensor networks is to provide area coverage for a specific task. This paper addresses the problem of default unknown network coverage by a group of sensor nodes with nonidentical coverage and communication capabilities. The sensors are mobile and detect the area in a distributed manner and provide optimal coverage. First, we model the coverage optimization problem as a repetitive multiplayer game in which a utility function is formulated to consider the quality of the coverage. Then, we propose a distributed payoff-based learning algorithm in which each sensor tries to maximize its utility function by moving to uncovered locations. The simulation results show the performance of the proposed algorithm