The Localized Area Coverage algorithm Based on Game-Theory for WSN
The Coverage Control Technology is one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting users’ perception demand. Among this, in the study of area coverage, the set K-cover algorithm is broadly accepted because that it can prolong network lifetime rather well. However, the existing set K-cover algorithms are centralized, and can not adapt to the large-scale sensor network applications and expansion. Game theory is a kind of decision theory, which is concerned with the situation where players directly interact with each other and can from the angle of participant’s rational favor look for root of influence on macro-construction. It is very suitable for characteristic of node in wireless sensor network, which is only to know its own and neighbors’ local state information and according to local information to implement behavior decision, making it convenient to realize distribution algorithm. In the previous work, the maximum coverage set calculated algorithm is proposed by us. So , this paper utilizes the number of maximum coverage set as the upper limit of coverage node set division. O n the basis of this maximum, it takes number of minimum layer overlapping subfields, which satisfy division condition, as node’s utility function . Thus, this paper uses game theory model realizes maximization of network lifetime at the same time of ensuring area overall coverage. Then, it puts forward a distribution algorithm to get optimal strategy by iteration so as to reach realize Nash Equilibrium and realize node set’s rational division. Simulation results show it realizes maximization of network lifetime at the same time of ensuring area overall coverage.