Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
- Authors
- Kim, Donghyun; Wang, Wei; Ding, Ling; Lim, Jihwan; Oh, Heekuck; Wu, Weili
- Issue Date
- Aug-2010
- Publisher
- SPRINGER HEIDELBERG
- Keywords
- Approximation algorithm; Graph theory; Wireless network clustering; Underwater sensor networks
- Citation
- OPTIMIZATION LETTERS, v.4, no.3, pp.383 - 392
- Indexed
- SCIE
SCOPUS
- Journal Title
- OPTIMIZATION LETTERS
- Volume
- 4
- Number
- 3
- Start Page
- 383
- End Page
- 392
- ISSN
- 1862-4472
- 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.
- Files in This Item
- Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > ERICA 컴퓨터학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Oh, Hee kuck
- ERICA 소프트웨어융합대학 (ERICA 컴퓨터학부)