A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
Previously, we proposed Minimum Average Routing Path Clustering Problem (MARPCP) in multi-hop USNs. The goal of this problem is to find a clustering of a USN so that the average clustering-based routing path from a node to it nearest underwater sink is minimized. We relaxed MARPCP to a special case of Minimum Weight Dominating Set Problem (MWDSP), namely MWDSP-R. In addition, we showed the Performance Ratio (PR) of α-approximation algorithm for MWDSP-R is 3α for MARPCP. Based on this result, we showed the existence of a (15 + ∊)-approximation algorithm for MARPCP. In this paper, we first establish the NP-completeness of both MARPCP and MWDSP-R. Then, we propose a PTAS for MWDSP-R. By combining this result with our previous one, we have a (3 + ∊)-approximation algorithm for MARPCP.