A distributed algorithm for Ad-hoc network partitioning based on Voronoi Tessellation

This paper presents a data sink node election algorithm for multi-hop Wireless Sensor Networks (WSNs) with multiple data sink nodes. For energy-saving considerations, these nodes should be evenly (spatially) distributed on the network area. To achieve this objective, it proposed a distributed and iterative algorithm, which periodically re-assigns the data sink roles to selected WSN nodes. The main innovation of the algorithm is that, even if it does not need to explicitly compute the Voronoi partition of the WSN at each iteration, it eventually partitions the network according to a Centroidal Voronoid Tessellation, which leads to a spatially well-balanced distribution of the data sink nodes. Analytical proofs as well as simulation results validate the approach.