The Approximate Minimum Set of Connecting and Covering Arithmetic for Sensor Network Partitioned by Regular Hexagons

Abstract: Based on the feature that Voronoi grid is capable of dividing plane domain into simple geometry gatherings and on the theory of parallel collecting, this paper puts forward the approximately minimum connecting and covering algorithm (ACA-RH) for wireless sensor network partitioned by regular hexagons (grids) to construct the minimum connecting coverage set, in which sink nodes divide information collecting area into regular hexagons, and the sensors decide to work or sleep by calculating its distance to the center of the grid it belongs to. Theoretical analysis and simulation show that ACA-RH has better performance in time complexity, and it requires less grids, compared with SCR-CADS and So&Ye algorithms