Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks |
| |
| Authors: | Donghyun Kim Wei Wang Ling Ding Jihwan Lim Heekuck Oh Weili Wu |
| |
| Institution: | 1.Department of Computer Science,University of Texas at Dallas,Richardson,USA;2.Department of Mathematics,Xi’an Jiaotong University,Xi’an,People’s Republic of China;3.Department of Computer Science and Engineering,Hanyang University,Ansan, Gyeonggi,Republic of Korea |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
