Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation

Table 1

Comparison of the execution time (in seconds) of the two proposed algorithms.

Algorithm/number of points	100	200	300	400	500
Hexagon-I	396.87	3494.42	6314.50	9755.30	12923.42
Hexagon-II	0.37	0.40	0.43	0.45	0.47