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

Figure 5

Performance comparison of the optimal solutions to the solutions of the proposed algorithms with triangle tessellation, square tessellation, and hexagon tessellation. (Hexagon-I and Hexagon-II use the algorithms in Figure 2 with and Figure 3, resp.).