Distributed node localization is an important issue in wireless sensor networks.However

traditional distributed localization algorithms have the drawback of low localization accuracy and high processing complexity.In response to these problems

a distributed localization model based on game theory is presented

where the utility function for each participant is defined as the sum of neighbor distance error.Formally

the proposed localization game is proved as a type of potential game.Through theoretical analysis

the existence of Nash Equilibrium and the validity of the final converged solution are testified.Furthermore

a distributed localization algorithm based on game theory is proposed

where each sensor exchanging information only with its neighbors.Finally

to avoid converging in local optimum and accelerate the convergence speed

the strategy space determination and unknown nodes elevation are developed.Extensive simulation results are performed to demonstrate the effectiveness of our proposed algorithm.