Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks

In this paper, we introduce a new clustering problem in underwater sensor networks, namely minimum average routing path clustering problem (MARPCP). To deal with the high complexity of MARPCP, we relax it to a special case of minimum weight dominating set problem (MWDSP). We show an existing algorithm for MWDSP can produce an approximate solution for MARPCP. Also, we design a constant factor approximation algorithm for MARPCP, which is much faster than the first method.

[1]  Thomas Erlebach,et al.  Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.

[2]  Decheng Dai,et al.  A 5 +-approximation algorithm for minimum weighted dominating set in unit disk graph , 2009 .

[3]  Xia Li,et al.  The study on clustering algorithm of the underwater acoustic sensor networks , 2007, 2007 14th International Conference on Mechatronics and Machine Vision in Practice.

[4]  Elizabeth M. Belding-Royer,et al.  Multi-Level Hierarchies for Scalable Ad hoc Routing , 2003, Wirel. Networks.

[5]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[6]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[7]  Changyuan Yu,et al.  A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph , 2009, Theor. Comput. Sci..

[8]  Ramesh Govindan,et al.  The Sensor Network as a Database , 2002 .

[9]  Cheng Li,et al.  Distributed Minimum-Cost Clustering Protocol for UnderWater Sensor Networks (UWSNs) , 2007, 2007 IEEE International Conference on Communications.

[10]  Donghyun Kim,et al.  A Better Approximation for Minimum Average Routing Path Clustering Problem in 2-d Underwater Sensor Networks , 2009, Discret. Math. Algorithms Appl..

[11]  P.H.J. Chong,et al.  A survey of clustering schemes for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[12]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[13]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[14]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.