Game theory and iterated Voronoi diagrams for self-organized Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have become an attractive technology to support various applications. In many situations, the region where the sensor nodes are deployed needs to be uniformly covered. This paper proposes a new technique to implement self-organization strategies for WSNs. We show that the process of iterating the computation of the Voronoi diagram generated by the sensors has a maximum fixed point which corresponds to the Nash equilibrium of a strategic game where sensor nodes move iteratively to the centers of the Voronoi cells. We have shown that this fixed-point represents the best deployment that can be achieved, from the coverage point of view. We also performed a set of experiments to show that the proposed technique outperform the existing approaches.