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

@article{Kim2010MinimumAR,
  title={Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks},
  author={Donghyun Kim and Wei Wang and Ling Ding and Jihwan Lim and Heekuck Oh and Weili Wu},
  journal={Optimization Letters},
  year={2010},
  volume={4},
  pages={383-392}
}
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. 

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

The study on clustering algorithm of the underwater acoustic sensor networks

  • X. Li, Fang, S.-L, Zhang, Y.-C
  • The 14th International Conference on Mechatronics…
  • 2007
3 Excerpts

Similar Papers

Loading similar papers…