Probabilistic Coverage in Wireless Sensor Networks: a Game Theoretical Approach

In this paper, the problem of full area coverage in wireless sensor networks is investigated by keeping the minimum number of heterogeneous sensor nodes. The coverage problem is considered for both deterministic and probabilistic heterogeneous sensors. We propose a new distributed game theory-based algorithm to maximize the area coverage while minimizing the number of activated sensors. Due to the energy limitations in sensor networks, we...